Sciweavers

1525 search results - page 98 / 305
» Matching with Regular Constraints
Sort
View
165
Voted
CVPR
2001
IEEE
16 years 5 months ago
Understanding Popout through Repulsion
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
Stella X. Yu, Jianbo Shi
ASAP
2003
IEEE
108views Hardware» more  ASAP 2003»
15 years 9 months ago
Physical Planning for On-Chip Multiprocessor Networks and Switch Fabrics
On-chip implementation of multiprocessor systems requires the planarization of the interconnect network onto the silicon floorplan. Manual floorplanning approaches will become i...
Terry Tao Ye, Giovanni De Micheli
136
Voted
RAS
2007
115views more  RAS 2007»
15 years 3 months ago
A variational method for the recovery of dense 3D structure from motion
The purpose of this study is to investigate a variational formulation of the problem of three-dimensional (3D) interpretation of temporal image sequences based on the 3D brightnes...
Hicham Sekkati, Amar Mitiche
APWEB
2011
Springer
14 years 11 months ago
Assisting the Design of XML Schema: Diagnosing Nondeterministic Content Models
One difficulty in the design of XML Schema is the restriction that the content models should be deterministic, i. e., the Unique Particle Attribution (UPA) constraint, which means ...
Haiming Chen, Ping Lu
NIPS
1997
15 years 5 months ago
Graph Matching with Hierarchical Discrete Relaxation
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt fo...
Richard C. Wilson, Edwin R. Hancock