154 search results - page 7 / 31 » Space efficient dynamic stabbing with fast queries |
CPM
2006
Springer
14 years 2 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...
UIST
2000
ACM
14 years 2 months ago
2000
ACM
We present a general approach to the dynamic representation of 2D space that is well suited for userinterface layout. We partition space into two distinct categories: full and emp...
AIPS
2008
14 years 20 days ago
2008
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
CPM
1998
Springer
14 years 2 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
ICIP
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper, we focus on a new application of mobile visual search: snapping a photo with a mobile device of a video playing on a TV screen to automatically retrieve and stream ...