Sciweavers

5130 search results - page 948 / 1026
» Constraint Query Languages
Sort
View
202
Voted
ICLP
2009
Springer
16 years 1 months ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
227
Voted
CP
2009
Springer
16 years 1 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
16 years 1 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu
104
Voted
CHI
2004
ACM
16 years 1 months ago
A commonsense approach to predictive text entry
People cannot type as fast as they think, especially when faced with the constraints of mobile devices. There have been numerous approaches to solving this problem, including rese...
Tom Stocky, Alexander Faaborg, Henry Lieberman
EDBT
2008
ACM
111views Database» more  EDBT 2008»
16 years 27 days ago
Schema polynomials and applications
Conceptual complexity is emerging as a new bottleneck as data-base developers, application developers, and database administrators struggle to design and comprehend large, complex...
Kenneth A. Ross, Julia Stoyanovich