Sciweavers

4541 search results - page 518 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
MSV
2004
15 years 8 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
207
Voted
ENTCS
2008
116views more  ENTCS 2008»
15 years 7 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis
NECO
2000
88views more  NECO 2000»
15 years 6 months ago
Practical Identifiability of Finite Mixtures of Multivariate Bernoulli Distributions
The class of finite mixtures of multivariate Bernoulli distributions is known to be nonidentifiable, i.e., different values of the mixture parameters can correspond to exactly the...
Miguel Á. Carreira-Perpiñán, ...
INFOCOM
2010
IEEE
15 years 4 months ago
High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting
On today's high-speed backbone network links, measuring per-flow traffic information has become very challenging. Maintaining exact per-flow packet counters on OC-192 or OC-76...
Peter Lieven, Björn Scheuermann
VIS
2007
IEEE
144views Visualization» more  VIS 2007»
16 years 8 months ago
Enhancing Depth-Perception with Flexible Volumetric Halos
Volumetric data commonly has high depth complexity which makes it difficult to judge spatial relationships accurately. There are many different ways to enhance depth perception, su...
Stefan Bruckner, M. Eduard Gröller