2498 search results - page 286 / 500 » Data Structures with Unpredictable Timing |
207
click to vote
CPM
2006
Springer
15 years 10 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...
187
click to vote
AAAI
2008
15 years 8 months ago
2008
ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is limited and to update sequentially with an increme...
167
click to vote
TKDE
2008
15 years 6 months ago
2008
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...
184
click to vote
ORL
2000
15 years 6 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
166
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper introduces a tracking method for the well known local MSER (Maximally Stable Extremal Region) detector. The component tree is used as an efficient data structure, which...