7129 search results - page 189 / 1426 » Approximation Algorithms for Treewidth |
171
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly spa...
119
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
131
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
118
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
142
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...