2107 search results - page 173 / 422 » Computing Small Search Numbers in Linear Time |
117
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
153
click to vote
CVPR
2011
IEEE
14 years 12 months ago
2011
IEEE
Non-rigid structure from motion (NR-SFM) is a difficult, underconstrained problem in computer vision. This paper proposes a new algorithm that revises the standard matrix factori...
171
click to vote
RTSS
2005
IEEE
15 years 9 months ago
2005
IEEE
Scratchpad memory is a popular choice for on-chip storage in real-time embedded systems. The allocation of code/data to scratchpad memory is performed at compile time leading to p...
138
click to vote
DCC
2002
IEEE
16 years 3 months ago
2002
IEEE
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
130
click to vote
CVPR
2001
IEEE
16 years 5 months ago
2001
IEEE
We consider learning models for object recognition from examples. Our method is motivated by systems that use the Hausdorff distance as a shape comparison measure. Typically an ob...