Sciweavers

10997 search results - page 1982 / 2200
» On the Structure of Complete Sets
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 3 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
129
Voted
ICCV
2011
IEEE
14 years 22 days ago
Learning a Category Independent Object Detection Cascade
Cascades are a popular framework to speed up object detection systems. Here we focus on the first layers of a category independent object detection cascade in which we sample a l...
Esa Rahtu, Juho Kannala, Matthew Blaschko
120
Voted
ICCV
2011
IEEE
14 years 22 days ago
An adaptive coupled-layer visual model for robust visual tracking
This paper addresses the problem of tracking objects which undergo rapid and significant appearance changes. We propose a novel coupled-layer visual model that combines the targe...
Luka Cehovin, Matej Kristan, Ales Leonardis
3DIM
2011
IEEE
14 years 22 days ago
6DoF Registration of 2D Laser Scans
—We address the problem of registering a set of 2D laser scans in 3D space with regard to six degrees of freedom. Registering single 2D scans is only possible when making strong ...
Benjamin Huhle, Timo Schairer, Andreas Schilling, ...
106
Voted
AAAI
2011
14 years 22 days ago
Relational Blocking for Causal Discovery
Blocking is a technique commonly used in manual statistical analysis to account for confounding variables. However, blocking is not currently used in automated learning algorithms...
Matthew J. Rattigan, Marc E. Maier, David Jensen
« Prev « First page 1982 / 2200 Last » Next »