Sciweavers

4541 search results - page 595 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 11 months ago
An Improved Construction for Counting Bloom Filters
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
FUN
2010
Springer
219views Algorithms» more  FUN 2010»
15 years 10 months ago
The Magic of a Number System
We introduce a new number system that supports increments with a constant number of digit changes. We also give a simple method that extends any number system supporting increments...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
WFLP
2000
Springer
82views Algorithms» more  WFLP 2000»
15 years 10 months ago
Strong and NV-sequentiality of constructor systems
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
Salvador Lucas
DIS
2008
Springer
15 years 9 months ago
Ensemble-Trees: Leveraging Ensemble Power Inside Decision Trees
Decision trees are among the most effective and interpretable classification algorithms while ensembles techniques have been proven to alleviate problems regarding over-fitting and...
Albrecht Zimmermann
EMNLP
2008
15 years 8 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney