4843 search results - page 589 / 969 » The Shortcut Problem - Complexity and Approximation |
160
click to vote
SSDBM
1999
IEEE
15 years 9 months ago
1999
IEEE
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
141
click to vote
VISUALIZATION
1997
IEEE
15 years 9 months ago
1997
IEEE
We present a multiresolution framework, called Multi-Tetra framework, that approximates volume data with different levelsof-detail tetrahedra. The framework is generated through a...
172
Voted
CIAC
1994
Springer
15 years 9 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
165
click to vote
ESA
1993
Springer
15 years 9 months ago
1993
Springer
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
144
click to vote
3DIM
2007
IEEE
15 years 8 months ago
2007
IEEE
An algorithm is presented to estimate the position of a hand-held camera with respect to a 3d world model constructed from range data and color imagery. Little prior knowledge is ...