562 search results - page 79 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
76
Voted
ALGOSENSORS
2007
Springer
15 years 3 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
CP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
131
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Autonomous systems which learn and utilize a limited
visual vocabulary have wide spread applications.
Enabling such systems to segment a set of cluttered scenes
into objects is ...
115
click to vote
CVPR
2011
IEEE
14 years 1 months ago
2011
IEEE
Recovering 3D geometry from a single view of an object is an important and challenging problem in computer vision. Previous methods mainly focus on one specific class of objects ...