1236 search results - page 112 / 248 » fast 2010 |
136
click to vote
DCC
2010
IEEE
15 years 10 months ago
2010
IEEE
Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decom...
126
Voted
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
142
Voted
CPM
2010
Springer
15 years 8 months ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
134
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We present a fast and accurate algorithm for computing the 2D pose of objects in images called cascaded pose regression (CPR). CPR progressively refines a loosely specified initia...
179
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper addresses the problem of recognizing freeform 3D objects in point clouds. Compared to traditional approaches based on point descriptors, which depend on local informati...