Sciweavers

ALENEX
2011
416views Algorithms» more  ALENEX 2011»
13 years 3 months ago
Exact Pattern Matching with Feed-Forward Bloom Filters
This paper presents an algorithm for exact pattern matching based on a new type of Bloom filter that we call a feed-forward Bloom filter. Besides filtering the input corpus, a ...
Iulian Moraru, David G. Andersen
CIDR
2011
401views Algorithms» more  CIDR 2011»
13 years 3 months ago
DBease: Making Databases User-Friendly and Easily Accessible
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
Guoliang Li, Ju Fan, Hao Wu, Jiannan Wang, Jianhua...
AAECC
2011
Springer
380views Algorithms» more  AAECC 2011»
13 years 6 months ago
The generalized road coloring problem and periodic digraphs
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
G. Budzban, Ph. Feinsilver
CIDR
2011
342views Algorithms» more  CIDR 2011»
13 years 3 months ago
Megastore: Providing Scalable, Highly Available Storage for Interactive Services
Megastore is a storage system developed to meet the requirements of today’s interactive online services. Megastore blends the scalability of a NoSQL datastore with the convenien...
Jason Baker, Chris Bond, James Corbett, J. J. Furm...
AAIM
2011
Springer
337views Algorithms» more  AAIM 2011»
13 years 3 months ago
On Variants of the Spanning Star Forest Problem
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
Jing He, Hongyu Liang
Algorithms
Top of PageReset Settings