4850 search results - page 230 / 970 » Approximate Data Structures with Applications |
169
click to vote
ICS
2001
Tsinghua U.
15 years 11 months ago
2001
Tsinghua U.
The caching behavior of multimedia applications has been described as having high instruction reference locality within small loops, very large working sets, and poor data cache p...
210
click to vote
MKM
2004
Springer
15 years 12 months ago
2004
Springer
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
228
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...
205
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Whole genome sequence data is a step towards generating the 'parts list' of life to understand the underlying principles of Biocomplexity. Genome sequencing ...
191
click to vote
MIDDLEWARE
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. To disseminate messages from a single source to a large number of targeted receivers, a natural approach is the tree-based application layer multicast (ALM). However, in ...