Sciweavers

2127 search results - page 136 / 426
» Computing large matchings fast
Sort
View
INFOCOM
2011
IEEE
14 years 7 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
ICCV
2005
IEEE
15 years 9 months ago
Mutual Information-Based 3D Surface Matching with Applications to Face Recognition and Brain Mapping
Face recognition and many medical imaging applications require the computation of dense correspondence vector fields that match one surface with another. In brain imaging, surfac...
Yalin Wang, Ming-Chang Chiang, Paul M. Thompson
IPPS
2003
IEEE
15 years 9 months ago
Accurate Method for Fast Design of Diagnostic Oligonucleotide Probe Sets for DNA Microarrays
We present a method for the automatic generation of oligonucleotide probe sets for DNA microarrays. This approach is well suited particularly for specificity evaluation of design...
Andreas Krause, Markus Kräutner, Harald Meier
ICPR
2002
IEEE
16 years 5 months ago
A Neural Architecture for Fast and Robust Face Detection
In this paper, we present a connectionist approach for detecting and precisely localizing semi-frontal human faces in complex images, making no assumption about the content or the...
Christophe Garcia, Manolis Delakis
ACL
2012
13 years 6 months ago
Fast Syntactic Analysis for Statistical Language Modeling via Substructure Sharing and Uptraining
Long-span features, such as syntax, can improve language models for tasks such as speech recognition and machine translation. However, these language models can be difficult to u...
Ariya Rastrow, Mark Dredze, Sanjeev Khudanpur