4536 search results - page 86 / 908 » Contention-Sensitive Data Structures and Algorithms |
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
FTCGV
2011
13 years 16 days ago
2011
Powerful statistical models that can be learned efficiently from large amounts of data are currently revolutionizing computer vision. These models possess a rich internal structur...
IVC
2002
13 years 8 months ago
2002
In this paper we address the problem of recovering structure and motion from the apparent contours of a smooth surface. Fixed image features under circular motion and their relati...