default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCoRR, December 2002
- Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt:
Traveling Salesmen in the Presence of Competition. - Alfredo Braunstein, Marc Mézard, Riccardo Zecchina:
Survey propagation: an algorithm for satisfiability. - Anindya Banerjee, David A. Naumann:
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs. - Jan Chomicki, Jerzy Marcinkowski:
Minimal-Change Integrity Maintenance Using Tuple Deletions. - Laurent Regnier, Pawel Urzyczyn:
Retractions of Types with Many Atoms. - Gianluca Argentini:
Use of openMosix for parallel I/O balancing on storage in Linux cluster. - Marshall W. Bern, David Eppstein:
Optimized Color Gamuts for Tiled Displays. - Zhenyue Zhang, Hongyuan Zha:
Principal Manifolds and Nonlinear Dimension Reduction via Local Tangent Space Alignment. - Giorgio Parisi:
On the survey-propagation equations for the random K-satisfiability problem. - Arnold Smith, Peter D. Turney, Robert Ewaschuk:
JohnnyVon: Self-Replicating Automata in Continuous Two-Dimensional Space. - Peter D. Turney:
Mining the Web for Lexical Knowledge to Improve Keyphrase Extraction: Learning from Labeled and Unlabeled Data. - Peter D. Turney, Michael L. Littman:
Unsupervised Learning of Semantic Orientation from a Hundred-Billion-Word Corpus. - Peter D. Turney:
Learning to Extract Keyphrases from Text. - 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. - Jan Chomicki, Sofie Haesevoets, Bart Kuijpers, Peter Z. Revesz:
Classes of Spatiotemporal Objects and Their Closure Properties. - Pierre B. A. Lecomte, Michel Rigo:
Real numbers having ultimately periodic representations in abstract numeration systems. - Jörg D. Becker:
Thinking, Learning, and Autonomous Problem Solving. - Peter D. Turney:
Learning Algorithms for Keyphrase Extraction. - Peter D. Turney:
A Simple Model of Unbounded Evolutionary Versatility as a Largest-Scale Trend in Organismal Evolution. - Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell:
Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments. - Peter D. Turney:
How to Shift Bias: Lessons from the Baldwin Effect. - Alexander Clark:
Unsupervised Language Acquisition: Theory and Practice. - Istvan Szita, Bálint Takács, András Lörincz:
Searching for Plannable Domains can Speed up Reinforcement Learning. - Étienne Payet, Frédéric Mesnard:
A Generalization of the Lifting Lemma for Logic Programming. - G. A. Monerat, E. V. Correa Silva, A. G. Cyrino:
Qualitative Study of a Robot Arm as a Hamiltonian System. - Peter D. Turney:
Technical Note: Bias and the Quantification of Stability. - Peter D. Turney:
A Theory of Cross-Validation Error. - Peter D. Turney:
Theoretical Analyses of Cross-Validation Error and Voting in Instance-Based Learning. - Peter D. Turney, Michael Halasz:
Contextual Normalization Applied to Aircraft Gas Turbine Engine Diagnosis. - Peter D. Turney:
Thumbs Up or Thumbs Down? Semantic Orientation Applied to Unsupervised Classification of Reviews. - Peter D. Turney:
Mining the Web for Synonyms: PMI-IR versus LSA on TOEFL. - Peter D. Turney:
Types of Cost in Inductive Concept Learning. - Peter D. Turney:
Exploiting Context When Learning to Classify. - Peter D. Turney:
Myths and Legends of the Baldwin Effect. - 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:
Robust Classification with Context-Sensitive Features. - Peter D. Turney:
Increasing Evolvability Considered as a Large-Scale Trend in Evolution. - Xianfeng Gu, Shing-Tung Yau:
Computing Conformal Structure of Surfaces. - Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. - Rodrigo B. Almeida, Virgílio A. F. Almeida:
Local Community Identification through User Access Patterns. - Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. - Giorgio Parisi:
On local equilibrium equations for clustering states. - Ralf Lämmel, Joost Visser:
Strategic polymorphism requires just two combinators! - Nicole Schweikardt:
An Ehrenfeucht-Fraisse Game Approach to Collapse Results in Database Theory. - Erik D. Demaine, Joseph O'Rourke:
Open Problems from CCCG 2002. - Asuman Dogac, Gokce Laleci, Yildiray Kabak, Ibrahim Cingil:
ExploitingWeb Service Semantics: Taxonomies vs. Ontologies. - Asuman Dogac, Ibrahim Cingil, Gokce Laleci, Yildiray Kabak:
Improving the Functionality of UDDI Registries through Web Service Semantics. - Paolo Liberatore:
Merging Locally Correct Knowledge Bases: A Preliminary Report. - Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun:
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. - Alfredo Braunstein, Marc Mézard, Martin Weigt, Riccardo Zecchina:
Constraint Satisfaction by Survey Propagation. - 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.
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 2025-02-24 21:33 CET 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:
