458 search results - page 60 / 92 » Linear Time Algorithms for Clustering Problems in Any Dimens... |
ICISP
2010
Springer
14 years 3 days ago
2010
Springer
Compressed Imaging is the theory that studies the problem of image recovery from an under-determined system of linear measurements. One of the most popular methods in this field i...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
ACID
2006
13 years 10 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
— In many computer vision related applications it is necessary to distinguish between the background of an image and the objects that are contained in it. This is a difficult pr...