Sciweavers

248 search results - page 11 / 50
» New Approximation Algorithms for Minimum Cycle Bases of Grap...
Sort
View
INFOCOM
2011
IEEE
12 years 11 months ago
Construction of directional virtual backbones with minimum routing cost in wireless networks
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wo...
JGT
2008
59views more  JGT 2008»
13 years 7 months ago
Pebbling and optimal pebbling in graphs
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
David P. Bunde, Erin W. Chambers, Daniel W. Cranst...
UAI
2008
13 years 9 months ago
Convergent Message-Passing Algorithms for Inference over General Graphs with Convex Free Energies
Inference problems in graphical models can be represented as a constrained optimization of a free energy function. It is known that when the Bethe free energy is used, the fixedpo...
Tamir Hazan, Amnon Shashua
COLING
2010
13 years 2 months ago
Multi-Document Summarization via the Minimum Dominating Set
Multi-document summarization aims to distill the most important information from a set of documents to generate a compressed summary. Given a sentence graph generated from a set o...
Chao Shen, Tao Li
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
13 years 11 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian