Sciweavers

110 search results - page 14 / 22
» Spectral Graph Theory and its Applications
Sort
View
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
14 years 7 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
CHI
2007
ACM
14 years 8 months ago
Computer aided observations of complex mobile situations
Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach the...
Tobias Klug
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
14 years 2 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
MST
2010
187views more  MST 2010»
13 years 2 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
JSAC
2008
106views more  JSAC 2008»
13 years 7 months ago
A Low-Complexity Detector for Large MIMO Systems and Multicarrier CDMA Systems
We consider large MIMO systems, where by `large' we mean number of transmit and receive antennas of the order of tens to hundreds. Such large MIMO systems will be of immense i...
K. Vishnu Vardhan, Saif K. Mohammed, Ananthanaraya...