Sciweavers

1045 search results - page 165 / 209
» The Use of Exceptions
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 8 days ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
ECMAST
1998
Springer
118views Multimedia» more  ECMAST 1998»
14 years 8 days ago
Error-Robustness of Polar Contour-Coding
For communication using digital video, compression is mandatory because of the high bit-rate requiring a large bandwidth or storage capacity. Recent developments as well as upcomi...
Frank H. P. Spaan, Reginald L. Lagendijk, Jan Biem...
DAGM
2009
Springer
13 years 12 months ago
An Efficient Linear Method for the Estimation of Ego-Motion from Optical Flow
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
Florian Raudies, Heiko Neumann
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
13 years 11 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna
OPODIS
2007
13 years 9 months ago
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?
Consider the following game between a worm and an alert3 over a network of n nodes. Initially, no nodes are infected or alerted and each node in the network is a special detector n...
James Aspnes, Navin Rustagi, Jared Saia