Sciweavers

140 search results - page 23 / 28
» Eliminating Dependent Pattern Matching
Sort
View
CIARP
2007
Springer
15 years 4 months ago
A Method for Estimating Authentication Performance over Time, with Applications to Face Biometrics
Underlying biometrics are biological tissues that evolve over time. Hence, biometric authentication (and recognition in general) is a dynamic pattern recognition problem. We propos...
Norman Poh, Josef Kittler, Raymond S. Smith, Jose ...
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 4 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri
SPIN
2009
Springer
15 years 4 months ago
Identifying Modeling Errors in Signatures by Model Checking
: Most intrusion detection systems deployed today apply misuse detection as analysis method. Misuse detection searches for attack traces in the recorded audit data using predefined...
Sebastian Schmerl, Michael Vogel, Hartmut Kön...
IPPS
2007
IEEE
15 years 4 months ago
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
Robert Hall, Arnold L. Rosenberg, Arun Venkatarama...
FCT
2005
Springer
15 years 3 months ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...