CoRR, September 2000
Andrei N. Soklakov: Complexity analysis for algorithmically simple strings.- John Watrous: Succinct quantum proofs for properties of finite groups.
- David Eppstein: Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction.
- 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.
- Marco Aiello, Christof Monz, Leon Todoran: Combining Linguistic and Spatial Information for Document Analysis.
- Christof Monz: Contextual Inference in Computational Semantics.
- Christof Monz: Computing Presuppositions by Contextual Reasoning.
- 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.
- Rens Bod: Parsing with the Shortest Derivation.
- Rens Bod: An improved parser for data-oriented lexical-functional analysis.
- 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.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team