54 search results - page 5 / 11 » Checking Value-Sensitive Data Structures in Sublinear Space |
123
Voted
CACM
2010
14 years 11 months ago
2010
As it becomes increasingly viable to capture, store, and share large amounts of image and video data, automatic image analysis is crucial to managing visual information. Many prob...
96
Voted
FORMATS
2007
Springer
15 years 7 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
119
Voted
CVPR
2010
IEEE
15 years 4 days ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
115
Voted
SIGCOMM
2006
ACM
15 years 7 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
134
Voted
ASPLOS
1996
ACM
15 years 5 months ago
1996
ACM
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...