3341 search results - page 272 / 669 » On Bounded Queries and Approximation |
180
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
195
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
262
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
170
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
183
click to vote
WIOPT
2006
IEEE
16 years 21 days ago
2006
IEEE
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...