Sciweavers

7129 search results - page 54 / 1426
» Approximation Algorithms for Treewidth
Sort
View
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
14 years 4 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
SPAA
2009
ACM
15 years 10 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
JUCS
2008
158views more  JUCS 2008»
14 years 9 months ago
A Linear Time Approximation Algorithm for Ruler Folding Problem
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
Ali Nourollah, Mohammadreza Razzazi
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
15 years 10 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
ALT
2009
Springer
15 years 6 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee