Sciweavers

68 search results - page 2 / 14
» A New Approach for Speeding Up Enumeration Algorithms and It...
Sort
View
ICCV
2005
IEEE
13 years 10 months ago
Non-Orthogonal Binary Subspace and Its Applications in Computer Vision
This paper presents a novel approach that represents an image or a set of images using a nonorthogonal binary subspace (NBS) spanned by boxlike base vectors. These base vectors po...
Hai Tao, Ryan Crabb, Feng Tang
ICCV
2003
IEEE
14 years 6 months ago
Fast Vehicle Detection with Probabilistic Feature Grouping and its Application to Vehicle Tracking
Generating vehicle trajectories from video data is an important application of ITS (Intelligent Transportation Systems). We introduce a new tracking approach which uses model-base...
Zu Whan Kim, Jitendra Malik
ASPDAC
2007
ACM
124views Hardware» more  ASPDAC 2007»
13 years 8 months ago
BddCut: Towards Scalable Symbolic Cut Enumeration
While the covering algorithm has been perfected recently by the iterative approaches, such as DAOmap and IMap, its application has been limited to technology mapping. The main fact...
Andrew C. Ling, Jianwen Zhu, Stephen Dean Brown
DAC
2005
ACM
13 years 6 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
13 years 9 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli