1629 search results - page 162 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
ICC
2007
IEEE
15 years 2 months ago
2007
IEEE
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
131
click to vote
JMLR
2010
14 years 5 months ago
2010
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
ICDCSW
2002
IEEE
15 years 3 months ago
2002
IEEE
A key issue when designing and implementing largescale publish/subscribe systems is how to efficiently propagate subscriptions among the brokers of the system. Brokers require thi...
81
Voted
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract—A challenging aspect of mobile communications consists in exploring ways in which the available run time of terminals can be maximized. In this paper, we present a detai...