Sciweavers

1083 search results - page 199 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
CVPR
2010
IEEE
14 years 4 days ago
Metric-Induced Optimal Embedding for Intrinsic 3D Shape Analysis
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...
Rongjie Lai, Yonggang Shi, Kevin Scheibel, Scott F...
CVPR
2010
IEEE
14 years 3 days ago
Bundled Depth-Map Merging for Multi-View Stereo
Depth-map merging is one typical technique category for multi-view stereo (MVS) reconstruction. To guarantee accuracy, existing algorithms usually require either sub-pixel level s...
Jianguo Li
ECCV
2008
Springer
13 years 10 months ago
Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection
Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints...
Junbiao Pang, Qingming Huang, Shuqiang Jiang
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 9 months ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang
AI
2006
Springer
13 years 9 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth