18306 search results - page 480 / 3662 » Algorithmics in Exponential Time |
324
click to vote
ICDE
2006
IEEE
16 years 9 months ago
2006
IEEE
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
207
click to vote
ICML
2007
IEEE
16 years 8 months ago
2007
IEEE
Intuitively, learning should be easier when the data points lie on a low-dimensional submanifold of the input space. Recently there has been a growing interest in algorithms that ...
205
Voted
EDBT
2006
ACM
16 years 7 months ago
2006
ACM
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
168
click to vote
WALCOM
2010
IEEE
16 years 2 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
200
Voted
AAAI
2004
15 years 9 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...