1038 search results - page 144 / 208 » Space-Bounded Query Approximation |
140
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
156
Voted
SIGMETRICS
2012
ACM
13 years 5 months ago
2012
ACM
Latency has become an important metric for network monitoring since the emergence of new latency-sensitive applications (e.g., algorithmic trading and high-performance computing)....
125
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
128
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
96
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...