Sciweavers

1994 search results - page 161 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
BC
2004
97views more  BC 2004»
14 years 10 months ago
An elaborated model of fly small-target tracking
Flies have the capability to visually track small moving targets, even across cluttered backgrounds. Previous computational models, based on figure detection (FD) cells identified ...
Charles M. Higgins, Vivek Pant
ICIP
2010
IEEE
14 years 8 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
ICCD
2004
IEEE
97views Hardware» more  ICCD 2004»
15 years 7 months ago
Runtime Execution Monitoring (REM) to Detect and Prevent Malicious Code Execution
1 Many computer security threats involve execution of unauthorized foreign code on the victim computer. Viruses, network and email worms, Trojan horses, backdoor programs used in ...
A. Murat Fiskiran, Ruby B. Lee
SBACPAD
2003
IEEE
120views Hardware» more  SBACPAD 2003»
15 years 3 months ago
Comparison of Genomes Using High-Performance Parallel Computing
Comparison of the DNA sequences and genes of two genomes can be useful to investigate the common functionalities of the corresponding organisms and get a better understanding of h...
Nalvo F. Almeida Jr., Carlos E. R. Alves, Edson C&...
NETWORKS
2008
14 years 10 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...