7930 search results - page 585 / 1586 » Greedy in Approximation Algorithms |
181
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— In this note, we present initial results towards developing a distributed algorithm for repairing topological holes in the sensor cover of a mobile robot team. Central to our a...
241
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
HMM-based acoustic models built from bootstrap are generally very large, especially when full covariance matrices are used for Gaussians. Therefore, clustering is needed to compac...
239
click to vote
KDD
2010
ACM
15 years 11 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
230
click to vote
JNCA
2011
15 years 2 months ago
2011
Built upon a shared wireless medium, wireless mesh network is particularly vulnerable to jamming attacks. The ability to recover from attacks and maintain an acceptable level of s...
162
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...