Sciweavers

3145 search results - page 533 / 629
» Algebraic Linear Orderings
Sort
View
CONEXT
2007
ACM
15 years 8 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
CAV
2010
Springer
172views Hardware» more  CAV 2010»
15 years 8 months ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
DAC
2010
ACM
15 years 8 months ago
Lattice-based computation of Boolean functions
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
Mustafa Altun, Marc D. Riedel
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
15 years 8 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
15 years 8 months ago
Combining predictions for accurate recommender systems
We analyze the application of ensemble learning to recommender systems on the Netflix Prize dataset. For our analysis we use a set of diverse state-of-the-art collaborative filt...
Michael Jahrer, Andreas Töscher, Robert Legen...