Sciweavers

520 search results - page 96 / 104
» Reductions Between Expansion Problems
Sort
View
ECCV
2008
Springer
14 years 10 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
ICIP
2001
IEEE
14 years 10 months ago
Adaptive motion search with elastic diamond for MPEG-4 video coding
Video coding is a complex process, comprising a combination of spatial, temporal and statistical data reduction techniques. Of these techniques, motion estimation taking advantage...
Weiguo Zheng, Ishfaq Ahmad, Ming Lei Liou
DAC
2005
ACM
14 years 9 months ago
Multilevel full-chip routing for the X-based architecture
As technology advances into the nanometer territory, the interconnect delay has become a first-order effect on chip performance. To handle this effect, the X-architecture has been...
Tsung-Yi Ho, Chen-Feng Chang, Yao-Wen Chang, Sao-J...
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 9 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 9 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu