4541 search results - page 493 / 909 » Cache-Oblivious Algorithms and Data Structures |
223
click to vote
DIALM
2007
ACM
15 years 10 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
269
click to vote
GIS
2007
ACM
16 years 7 months ago
2007
ACM
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
191
click to vote
IWCIA
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
158
Voted
HIPC
2009
Springer
15 years 4 months ago
2009
Springer
- In this paper, we present a tool to extract I/O traces from very large applications running at full scale during their production runs. We analyze these traces to gain informatio...
236
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...