Sciweavers

1994 search results - page 104 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
NETWORKS
2008
14 years 9 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 2 months 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
SOCO
2007
Springer
15 years 4 months ago
Debugging Aspect-Enabled Programs
Abstract. The ability to debug programs composed using aspect-oriented programming (AOP) techniques is critical to the adoption of AOP. Nevertheless, many AOP systems lack adequate...
Marc Eaddy, Alfred V. Aho, Weiping Hu, Paddy McDon...
NETWORK
2011
14 years 21 days ago
Dynamic measurement-aware routing in practice
Traffic monitoring is a critical network operation for the purpose of traffic accounting, debugging or troubleshooting, forensics, and traffic engineering. Existing techniques for...
Guanyao Huang, Chen-Nee Chuah, Saqib Raza, Srini S...
ASAP
2007
IEEE
133views Hardware» more  ASAP 2007»
15 years 1 months ago
An Efficient Hardware Support for Control Data Validation
Software-based, fine-grain control flow integrity (CFI) validation technique has been proposed to enforce control flow integrity of program execution. By validating every indirect...
Yong-Joon Park, Zhao Zhang, Gyungho Lee