Sciweavers

672 search results - page 98 / 135
» Lower-stretch spanning trees
Sort
View
NETWORKING
2008
13 years 9 months ago
A Distributed Algorithm for Overlay Backbone Multicast Routing in Content Delivery Networks
Abstract. To support large-scale live Internet broadcasting services efficiently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end...
Jun Guo, Sanjay Jha
EACL
2006
ACL Anthology
13 years 9 months ago
Online Learning of Approximate Dependency Parsing Algorithms
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
Ryan T. McDonald, Fernando C. N. Pereira
PDPTA
2003
13 years 9 months ago
A Design for Node Coloring and 1-Fair Alternator on de Bruijn Networks
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
Jyh-Wen Mao, Chang-Biau Yang
CORR
2008
Springer
167views Education» more  CORR 2008»
13 years 7 months ago
Energy Scaling Laws for Distributed Inference in Random Networks
The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors independently distributed...
Animashree Anandkumar, Joseph E. Yukich, Lang Tong...
DISOPT
2010
132views more  DISOPT 2010»
13 years 7 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...