138 search results - page 10 / 28 » The Complexity of Quickly ORM-Decidable Sets |
COMPGEOM
2005
ACM
13 years 11 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
ICIP
2003
IEEE
14 years 11 months ago
2003
IEEE
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
SIGMOD
2003
ACM
14 years 10 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
3DPVT
2006
IEEE
14 years 3 months ago
2006
IEEE
Interactive network-based navigation over large urban environments raises difficult problems due to the size and complexity of these scenes. In this paper, we present a clientser...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
Software design techniques emphasize the use of abstractions to help developers deal with the complexity of constructing large and complex systems. These abstractions can also be u...