3341 search results - page 331 / 669 » On Bounded Queries and Approximation |
185
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
307
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Many of the data sources used in stream query processing are known to exhibit bursty behavior. Data in a burst often has different characteristics than steady-state data, and ther...
172
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
Type-ahead search is a new information-access paradigm, in which systems can find answers to keyword queries “onthe-fly” as a user types in a query. It improves traditional ...
151
click to vote
VLDB
2005
ACM
16 years 7 days ago
2005
ACM
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
191
Voted
COCO
2001
Springer
15 years 11 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...