3341 search results - page 365 / 669 » On Bounded Queries and Approximation |
163
click to vote
FUIN
2010
15 years 4 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
310
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
288
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
146
click to vote
WALCOM
2010
IEEE
16 years 1 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 ...
171
click to vote
DAWAK
2001
Springer
15 years 11 months ago
2001
Springer
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...