1480 search results - page 108 / 296 » Distributed algorithms for weighted problems in sparse graph... |
133
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
118
Voted
ICASSP
2010
IEEE
14 years 11 months ago
2010
IEEE
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
96
Voted
PODC
2006
ACM
15 years 6 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
93
Voted
WEA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
102
click to vote
ICMLA
2009
14 years 10 months ago
2009
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...