60 search results - page 9 / 12 » On Generalizations of Weighted Finite Automata and Graphics ... |
WWW
2005
ACM
16 years 10 days ago
2005
ACM
We present a browser extension to dynamically learn to filter unwanted images (such as advertisements or flashy graphics) based on minimal user feedback. To do so, we apply the we...
115
click to vote
AUTOMATICA
2008
14 years 11 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
91
Voted
STOC
2007
ACM
15 years 12 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
109
Voted
GLOBECOM
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Regular expression (Regex) becomes the standard signature language for security and application detection. Deterministic finite automata (DFAs) are widely used to perform...
120
click to vote
ANCS
2006
ACM
15 years 5 months ago
2006
ACM
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...