1480 search results - page 227 / 296 » Distributed algorithms for weighted problems in sparse graph... |
130
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
122
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
135
Voted
CONCUR
2006
Springer
15 years 5 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
138
click to vote
KES
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper considers the sensor network localization problem using signal strength. Unlike range-based methods signal strength information is stored in a kernel matrix. L...
155
click to vote
NIPS
2001
15 years 4 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...