Sciweavers

112 search results - page 14 / 23
» Faster deterministic dictionaries
Sort
View
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
13 years 10 months ago
Fast Motif Selection for Biological Sequences
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Pavel P. Kuksa, Vladimir Pavlovic
IPPS
2007
IEEE
14 years 1 months ago
Peak-Performance DFA-based String Matching on the Cell Processor
The security of your data and of your network is in the hands of intrusion detection systems, virus scanners and spam filters, which are all critically based on string matching. ...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
PAMI
2008
146views more  PAMI 2008»
13 years 7 months ago
Optimal Randomized RANSAC
A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-specified probability. The solution i...
Ondrej Chum, Jiri Matas
CEC
2007
IEEE
14 years 1 months ago
A fractal representation for real optimization
— The chaos game, in which a moving point is repeatedly averaged toward randomly selected vertices of a triangle, is one method of generating the fractal called the Sierpinski tr...
Daniel A. Ashlock, Justin Schonfeld
INFOCOM
2007
IEEE
14 years 1 months ago
Multivariate Online Anomaly Detection Using Kernel Recursive Least Squares
— High-speed backbones are regularly affected by various kinds of network anomalies, ranging from malicious attacks to harmless large data transfers. Different types of anomalies...
Tarem Ahmed, Mark Coates, Anukool Lakhina