Sciweavers

1089 search results - page 131 / 218
» Randomness and Reducibility
Sort
View

Publication
179views
15 years 8 months ago
Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes
The size of computer networks, along with their bandwidths, is growing exponentially. To support these large, high-speed networks, it is neccessary to be able to forward packets in...
R. Jain
CVPR
2009
IEEE
15 years 5 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
CVPR
2004
IEEE
15 years 6 days ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
CVPR
2007
IEEE
15 years 6 days ago
Polarization and Phase-Shifting for 3D Scanning of Translucent Objects
Translucent objects pose a difficult problem for traditional structured light 3D scanning techniques. Subsurface scattering corrupts the range estimation in two ways: by drastical...
Tongbo Chen, Hendrik P. A. Lensch, Christian Fuchs...
ICIP
2006
IEEE
14 years 12 months ago
Robust Object Detection using Fast Feature Selection from Huge Feature Sets
This paper describes an efficient feature selection method that quickly selects a small subset out of a given huge feature set; for building robust object detection systems. In th...
Duy-Dinh Le, Shin'ichi Satoh