Sciweavers

2254 search results - page 210 / 451
» Computing the minimal covering set
Sort
View
CVPR
2004
IEEE
16 years 8 months ago
Dynamic Geodesic Snakes for Visual Tracking
Visual tracking using active contours is usually accomplished in a static framework. The active contour tracks the object of interest in a given frame of an image sequence, and th...
Marc Niethammer, Allen Tannenbaum
ICALP
2009
Springer
16 years 7 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
FROCOS
2007
Springer
16 years 25 days ago
Combining Proof-Producing Decision Procedures
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tr...
VTS
2003
IEEE
115views Hardware» more  VTS 2003»
15 years 12 months ago
Fault Testing for Reversible Circuits
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...
Ketan N. Patel, John P. Hayes, Igor L. Markov
FCT
2007
Springer
15 years 10 months ago
Multi-dimensional Packing with Conflicts
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
Leah Epstein, Asaf Levin, Rob van Stee