Sciweavers

1170 search results - page 44 / 234
» How Fast Is Too Fast
Sort
View
441
Voted
ICA
2012
Springer
13 years 10 months ago
Distributional Convergence of Subspace Estimates in FastICA: A Bootstrap Study
Independent component analysis (ICA) is possibly the most widespread approach to solve the blind source separation (BSS) problem. Many different algorithms have been proposed, tog...
Jarkko Ylipaavalniemi, Nima Reyhani, Ricardo Vig&a...
127
Voted
CVPR
2007
IEEE
16 years 4 months ago
Fast Terrain Classification Using Variable-Length Representation for Autonomous Navigation
We propose a method for learning using a set of feature representations which retrieve different amounts of information at different costs. The goal is to create a more efficient ...
Anelia Angelova, Larry Matthies, Daniel M. Helmick...
CVPR
2007
IEEE
16 years 4 months ago
Fast Human Pose Estimation using Appearance and Motion via Multi-Dimensional Boosting Regression
We address the problem of estimating human pose in video sequences, where rough location has been determined. We exploit both appearance and motion information by defining suitabl...
Alessandro Bissacco, Ming-Hsuan Yang, Stefano Soat...
ICIP
1999
IEEE
16 years 4 months ago
A Fast Algorithm for Rigid Structure from Image Sequences
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
Pedro M. Q. Aguiar, José M. F. Moura
121
Voted
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 2 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan