4850 search results - page 327 / 970 » Approximate Data Structures with Applications |
161
click to vote
ADHOC
2010
15 years 6 months ago
2010
We propose an algorithm for the hierarchical aggregation of observations in dissemination-based, distributed traffic information systems. Instead of transmitting observed paramete...
174
click to vote
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...
167
click to vote
WEA
2007
Springer
16 years 25 days ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
199
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
160
click to vote
DEBS
2007
ACM
15 years 8 months ago
2007
ACM
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...