147 search results - page 15 / 30 » Very sparse random projections |
MST
2010
13 years 6 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
MCS
2007
Springer
14 years 1 months ago
2007
Springer
Rotation Forest is a recently proposed method for building classifier ensembles using independently trained decision trees. It was found to be more accurate than bagging, AdaBoost...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
The Bounded Hough Transform is introduced to track objects in a sequence of sparse range images. The method is based upon a variation of the General Hough Transform that exploits ...