default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCoRR, September 2000
- Andrei N. Soklakov:
Complexity analysis for algorithmically simple strings. - John Watrous:
Succinct quantum proofs for properties of finite groups. - Anoop Sarkar, Daniel Zeman:
Automatic Extraction of Subcategorization Frames for Czech. - Les Carr, Steve Hitchcock, Wendy Hall, Stevan Harnad:
A usage based analysis of CoRR. - David Eppstein, Joseph Wang:
Fast Approximation of Centrality. - David Eppstein:
Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction. - Foster J. Provost, Tom Fawcett:
Robust Classification for Imprecise Environments. - Erik F. Tjong Kim Sang, Sabine Buchholz:
Introduction to the CoNLL-2000 Shared Task: Chunking. - Ion Androutsopoulos, Georgios Paliouras, Vangelis Karkaletsis, Georgios Sakkis, Constantine D. Spyropoulos, Panagiotis Stamatopoulos:
Learning to Filter Spam E-Mail: A Comparison of a Naive Bayesian and a Memory-Based Approach. - Martin Grohe:
Computing Crossing Numbers in Quadratic Time. - Masaki Murata:
Anaphora Resolution in Japanese Sentences Using Surface Expressions and Examples. - Christof Monz:
Modeling Ambiguity in a Multi-Agent System. - Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian:
Pattern Matching for sets of segments. - Marco Aiello, Christof Monz, Leon Todoran:
Combining Linguistic and Spatial Information for Document Analysis. - Christof Monz, Maarten de Rijke:
A Tableaux Calculus for Ambiguous Quantification. - Christof Monz:
Contextual Inference in Computational Semantics. - Christof Monz, Maarten de Rijke:
A Tableau Calculus for Pronoun Resolution. - Christof Monz, Maarten de Rijke:
A Resolution Calculus for Dynamic Semantics. - Christof Monz:
Computing Presuppositions by Contextual Reasoning. - Mark Baker, Rajkumar Buyya, Daniel C. Hyde:
Cluster Computing: A High-Performance Contender. - Rajkumar Buyya, David Abramson, Jonathan Giddy:
Nimrod/G: An Architecture of a Resource Management and Scheduling System in a Global Computational Grid. - Gerard Escudero, Lluís Màrquez, German Rigau:
A Comparison between Supervised Learning Algorithms for Word Sense Disambiguation. - Alex Brodsky, Stephane Durocher, Ellen Gethner:
The Rectilinear Crossing Number of K_10 is 62. - Marshall W. Bern, David Eppstein:
Computing the Depth of a Flat. - Rens Bod:
Parsing with the Shortest Derivation. - Rens Bod:
An improved parser for data-oriented lexical-functional analysis. - Yair Even-Zohar, Dan Roth:
A Classification Approach to Word Prediction. - Alex Brodsky, Stephane Durocher, Ellen Gethner:
Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics. - Matthew M. Huntbach:
The Concurrent Language Aldwych. - Yong Xiao, Zena M. Ariola, Michel Mauny:
From Syntactic Theories to Interpreters: A Specification Language and Its Compilation. - Gavriel Segre:
The definition of a random sequence of qubits: from Noncommutative Algorithmic Probability Theory to Quantum Algorithmic Information Theory and back. - Ilya Nemenman, William Bialek:
Occam factors and model-independent Bayesian learning of continuous distributions. - Ilya Nemenman:
Information theory and learning: a physical approach. - Martin Weigt, Alexander K. Hartmann:
Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-23 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
