Gianluca Argentini:
Use of openMosix for parallel I/O balancing on storage in Linux cluster.
Giorgio Parisi:
On the survey-propagation equations for the random K-satisfiability problem.
Peter D. Turney:
Mining the Web for Lexical Knowledge to Improve Keyphrase Extraction: Learning from Labeled and Unlabeled Data.
Peter D. Turney:
Extraction of Keyphrases from Text: Evaluation of Four Algorithms.
Peter D. Turney:
Answering Subcognitive Turing Test Questions: A Reply to French.
Tobias Riege,
Jörg Rothe:
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem.
Peter D. Turney:
A Simple Model of Unbounded Evolutionary Versatility as a Largest-Scale Trend in Organismal Evolution.
Peter D. Turney:
Theoretical Analyses of Cross-Validation Error and Voting in Instance-Based Learning.
Peter D. Turney:
Thumbs Up or Thumbs Down? Semantic Orientation Applied to Unsupervised Classification of Reviews.
Peter D. Turney:
The Management of Context-Sensitive Features: A Review of Strategies.
Peter D. Turney:
The Identification of Context-Sensitive Features: A Formal Definition of Context for Concept Learning.
Peter D. Turney:
Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification.
Peter D. Turney:
Data Engineering for the Analysis of Semiconductor Manufacturing Data.
Peter D. Turney:
Increasing Evolvability Considered as a Large-Scale Trend in Evolution.
Nicole Schweikardt:
An Ehrenfeucht-Fraisse Game Approach to Collapse Results in Database Theory.
Paolo Liberatore:
Merging Locally Correct Knowledge Bases: A Preliminary Report.
Frank Sottile:
Toric ideals, real toric varieties, and the moment map.
Bernd Fiedler:
Determination of the structure of algebraic curvature tensors by means of Young symmetrizers.
Kohtaro Tadaki:
A Generalization of Chaitin's Halting Probability \Omega and Halting Self-Similar Sets.
Marc Toussaint:
The structure of evolutionary exploration: On crossover, buildings blocks and Estimation-Of-Distribution Algorithms.
Kohtaro Tadaki:
Upper bound by Kolmogorov complexity for the probability in computable POVM measurement.
data released under the ODC-BY 1.0 license
