Sciweavers

642 search results - page 79 / 129
» Approximation Algorithms for Minimum K-Cut
Sort
View
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 5 days ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 12 days ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
SIAMJO
2010
246views more  SIAMJO 2010»
14 years 10 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
TWC
2010
14 years 6 months ago
Distributed consensus-based demodulation: algorithms and error analysis
This paper deals with distributed demodulation of space-time transmissions of a common message from a multiantenna access point (AP) to a wireless sensor network. Based on local me...
Hao Zhu, Alfonso Cano, Georgios B. Giannakis
SIAMSC
2008
179views more  SIAMSC 2008»
14 years 11 months ago
Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Santi S. Adavani, George Biros