Sciweavers

15033 search results - page 125 / 3007
» Complexity Theory and Algorithms
Sort
View
117
Voted
JCSS
2007
88views more  JCSS 2007»
15 years 3 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
Denis Xavier Charles
PODS
2010
ACM
197views Database» more  PODS 2010»
15 years 4 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 6 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
PODS
2004
ACM
189views Database» more  PODS 2004»
16 years 3 months ago
The Lixto Data Extraction Project - Back and Forth between Theory and Practice
We present the Lixto project, which is both a research project in database theory and a commercial enterprise that develops Web data extraction (wrapping) and Web service definiti...
Georg Gottlob, Christoph Koch, Robert Baumgartner,...
159
Voted
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
15 years 10 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard