3630 search results - page 691 / 726 » Fast Marching Methods |
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
SIGMOD
2002
ACM
14 years 10 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
EDBT
2002
ACM
14 years 10 months ago
2002
ACM
Applying meta search systems is a suitable method to support the user if there are many different services. Due to information splitting strategies of literature services existing ...
EDBT
2008
ACM
14 years 10 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
PPOPP
2010
ACM
14 years 7 months ago
2010
ACM
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...