Sciweavers

3455 search results - page 280 / 691
» Generalized Game Trees
Sort
View
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 7 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
MOBIHOC
2002
ACM
16 years 6 months ago
Constructing minimum-energy broadcast trees in wireless ad hoc networks
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...
Weifa Liang
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
AINA
2007
IEEE
16 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
ICC
2007
IEEE
16 years 1 months ago
A Novel k-Parent Flooding Tree for Secure and Reliable Broadcasting in Sensor Networks
Abstract— Securing broadcast communication over sensor networks is an important research challenge. In general, broadcast communication has two important metrics: security and re...
Avinash Srinivasan, Jie Wu