2107 search results - page 4 / 422 » Computing Small Search Numbers in Linear Time |
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
The Internet contains billions of images, freely available online. Methods for efficiently searching this incredibly rich resource are vital for a large number of applications. Th...
ICMLA
2008
13 years 9 months ago
2008
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
ICCSA
2004
Springer
14 years 1 months ago
2004
Springer
We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate...
WG
2000
Springer
13 years 11 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...