Sciweavers

63 search results - page 6 / 13
» Subspace Codes
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Motion segmentation via robust subspace separation in the presence of outlying, incomplete, or corrupted trajectories
We examine the problem of segmenting tracked feature point trajectories of multiple moving objects in an image sequence. Using the affine camera model, this motion segmentation pr...
René Vidal, Roberto Tron, Shankar Rao, Yi M...
WWW
2007
ACM
14 years 8 months ago
Subspace: secure cross-domain communication for web mashups
Combining data and code from third-party sources has enabled a new wave of web mashups that add creativity and functionality to web applications. However, browsers are poorly desi...
Collin Jackson, Helen J. Wang
AAAI
2012
11 years 9 months ago
Convex Matching Pursuit for Large-Scale Sparse Coding and Subset Selection
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
Mingkui Tan, Ivor W. Tsang, Li Wang, Xinming Zhang
IJON
2006
100views more  IJON 2006»
13 years 7 months ago
Analyzing the robustness of redundant population codes in sensory and feature extraction systems
Sensory systems often use groups of redundant neurons to represent stimulus information both during transduction and population coding of features. This redundancy makes the syste...
Christopher J. Rozell, Don H. Johnson
COMBINATORICS
2007
86views more  COMBINATORICS 2007»
13 years 7 months ago
Lower Bounds for the Football Pool Problem for 7 and 8 Matches
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...
Wolfgang Haas