Sciweavers

5153 search results - page 322 / 1031
» Introduction to Randomized Algorithms
Sort
View
169
Voted
IDA
2009
Springer
15 years 1 months ago
Hierarchical Extraction of Independent Subspaces of Unknown Dimensions
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
Peter Gruber, Harold W. Gutch, Fabian J. Theis
CVPR
2012
IEEE
13 years 6 months ago
Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video
It has recently been shown that only a small number of samples from a low-rank matrix are necessary to reconstruct the entire matrix. We bring this to bear on computer vision prob...
Jun He, Laura Balzano, Arthur Szlam
STOC
2001
ACM
97views Algorithms» more  STOC 2001»
16 years 4 months ago
Sharp threshold and scaling window for the integer partitioning problem
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
Christian Borgs, Jennifer T. Chayes, Boris Pittel
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 10 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
FOCS
2002
IEEE
15 years 9 months ago
Learning a Hidden Matching
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...