3341 search results - page 504 / 669 » On Bounded Queries and Approximation |
166
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
The results of the Web query log analysis may be significantly shifted depending on the fraction of agents (non-human clients), which are not excluded from the log. To detect and ...
149
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
144
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
161
click to vote
AINA
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
167
click to vote
SSDBM
2007
IEEE
16 years 23 days ago
2007
IEEE
Memory management is a critical issue in stream processing involving stateful operators such as join. Traditionally, the memory requirement for a stream join is query-driven: a qu...