3341 search results - page 300 / 669 » On Bounded Queries and Approximation |
211
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
267
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
One of the simplest ways to query a database is through a form, where a user can fill in relevant information and obtain desired results by submitting the form. Designing good sta...
245
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to ru...
174
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...
174
click to vote
SPIRE
2004
Springer
16 years 2 days ago
2004
Springer
In the area of Text Retrieval, processing a query in the vector model has been verified to be qualitatively more effective than searching in the boolean model. However, in case o...