6300 search results - page 1144 / 1260 » We have it easy, but do we have it right |
116
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
FASE
2006
Springer
15 years 4 months ago
2006
Springer
Modern software codebases are frequently large, heterogeneous, and constantly evolving. The languages and tools for software construction, including code builds and configuration m...
153
click to vote
ESOP
2000
Springer
15 years 4 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
136
click to vote
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
103
click to vote
SIGMETRICS
1998
ACM
15 years 4 months ago
1998
ACM
We demonstrate that high-level le system events exhibit selfsimilar behaviour, but only for short-term time scales of approximately under a day. We do so through the analysis of f...