Sciweavers

1176 search results - page 95 / 236
» Sparse reward processes
Sort
View
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
16 years 4 months ago
Computer aided detection via asymmetric cascade of sparse hyperplane classifiers
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
Jinbo Bi, Senthil Periaswamy, Kazunori Okada, Tosh...
CISS
2008
IEEE
15 years 10 months ago
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
Mark A. Iwen, Craig V. Spencer
238
Voted
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
15 years 6 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof
CGF
2010
168views more  CGF 2010»
15 years 4 months ago
Modeling Complex Unfoliaged Trees from a Sparse Set of Images
We present a novel image-based technique for modeling complex unfoliaged trees. Existing tree modeling tools either require capturing a large number of views for dense 3D reconstr...
Luis D. Lopez, Yuanyuan Ding, Jingyi Yu
TWC
2008
133views more  TWC 2008»
15 years 4 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...