402 search results - page 32 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
101
click to vote
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
CCR
2006
15 years 15 days ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
101
Voted
DCC
2008
IEEE
16 years 1 days ago
2008
IEEE
We investigate the usage of edge-based inpainting as an intra prediction method in block-based image compression. The joint utilization of edge information and the well-known Lapl...
113
Voted
SIGIR
2005
ACM
15 years 6 months ago
2005
ACM
We formulate and study search algorithms that consider a user’s prior interactions with a wide variety of content to personalize that user’s current Web search. Rather than re...
135
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...