2570 search results - page 389 / 514 » Fast Algorithms For The Computation Of Ranklets |
136
Voted
SCALESPACE
2007
Springer
15 years 4 months ago
2007
Springer
People often recognize 3D objects by their boundary shape. Designing an algorithm for such a task is interesting and useful for retrieving objects from a shape database. In this pa...
80
Voted
3DIM
2005
IEEE
15 years 3 months ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
UIST
2005
ACM
15 years 3 months ago
2005
ACM
We introduce PlayAnywhere, a front-projected computer vision-based interactive table system which uses a new commercially available projection technology to obtain a compact, self...
VLDB
1998
ACM
15 years 2 months ago
1998
ACM
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
95
Voted
CPM
2006
Springer
15 years 1 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...