6251 search results - page 318 / 1251 » Randomness, Computability, and Density |
219
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
This paper describes a computational model for deriving a decomposition of objects from laser rangefinder data. The process aims to produce a set of parts defined by compactness a...
195
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
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...
166
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
166
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
221
click to vote
PERCOM
2009
ACM
16 years 1 months ago
2009
ACM
—Privacy protection is increasingly important during authentications in Radio Frequency Identification (RFID) systems. In order to achieve high-speed authentication in largescale...