Sciweavers

1381 search results - page 92 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
CVPR
2007
IEEE
16 years 6 months ago
Efficient Belief Propagation for Vision Using Linear Constraint Nodes
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
Brian Potetz
ICCV
2003
IEEE
16 years 6 months ago
Stochastic Refinement of the Visual Hull to Satisfy Photometric and Silhouette Consistency Constraints
An iterative method for reconstructing a 3D polygonal mesh and color texture map from multiple views of an object is presented. In each iteration, the method first estimates a tex...
John Isidoro, Stan Sclaroff
116
Voted
TALG
2010
110views more  TALG 2010»
15 years 2 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
SACRYPT
2005
Springer
109views Cryptology» more  SACRYPT 2005»
15 years 9 months ago
Reducing Time Complexity in RFID Systems
Radio frequency identification systems based on low-cost computing devices is the new plaything that every company would like to adopt. Its goal can be either to improve the produ...
Gildas Avoine, Etienne Dysli, Philippe Oechslin
149
Voted
SIGGRAPH
1997
ACM
15 years 8 months ago
The haptic display of complex graphical environments
Force feedback coupled with visual display allows people to interact intuitively with complex virtual environments. For this synergy of haptics and graphics to flourish, however, ...
Diego C. Ruspini, Krasimir Kolarov, Oussama Khatib