1994 search results - page 346 / 399 » Computation of Optical Flow Using Dynamic Programming |
SAC
2009
ACM
15 years 4 months ago
2009
ACM
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
ICDCS
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
79
Voted
SOSP
2007
ACM
15 years 6 months ago
2007
ACM
Attackers exploit software vulnerabilities to control or crash programs. Bouncer uses existing software instrumentation techniques to detect attacks and it generates filters auto...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...