Sciweavers

554 search results - page 60 / 111
» Power Domination Problem in Graphs
Sort
View
JDA
2008
94views more  JDA 2008»
13 years 7 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
CEAS
2006
Springer
13 years 11 months ago
CC Prediction with Graphical Models
We address the problem of suggesting who to add as an additional recipient (i.e. cc, or carbon copy) for an email under composition. We address the problem using graphical models ...
Chris Pal
ECCV
2006
Springer
14 years 9 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 8 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
MMNS
2007
120views Multimedia» more  MMNS 2007»
13 years 9 months ago
Broadcasting in Multi-Radio Multi-Channel and Multi-Hop Wireless Networks
An important question in multi-radio multi-channel and multi-hop networks is how to perform efficient network-wide broadcast. Currently almost all broadcasting protocols assume a s...
Li Li, Bin Qin, Chunyuan Zhang