Sciweavers

1679 search results - page 155 / 336
» Pointcuts as Functional Queries
Sort
View
SIGIR
2011
ACM
14 years 7 months ago
Ad hoc IR: not much room for improvement
Ranking function performance reached a plateau in 1994. The reason for this is investigated. First the performance of BM25 is measured as the proportion of queries satisfied on th...
Andrew Trotman, David Keeler
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 5 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
16 years 5 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
16 years 5 months ago
Holistic UDAFs at streaming speeds
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
Graham Cormode, Theodore Johnson, Flip Korn, S. Mu...
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
15 years 11 months ago
Dynamic Highway-Node Routing
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
Dominik Schultes, Peter Sanders