Sciweavers

2463 search results - page 289 / 493
» Rankings of Directed Graphs
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 3 months ago
Rate and power allocation under the pairwise distributed source coding constraint
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
Shizheng Li, Aditya Ramamoorthy
101
Voted
JGAA
2006
72views more  JGAA 2006»
15 years 3 months ago
A Multilevel Algorithm for the Minimum 2-sum Problem
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...
Ilya Safro, Dorit Ron, Achi Brandt
106
Voted
EJC
2007
15 years 3 months ago
Partial linear spaces built on hexagons
3 We define four families of geometries with as point graph the graph — or its complement — of all elliptic 4 hyperplanes of a given parabolic quadric in any finite 6-dimensi...
Alice Devillers, Hendrik Van Maldeghem
139
Voted
CCR
1998
96views more  CCR 1998»
15 years 3 months ago
On routes and multicast trees in the Internet
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
Jean-Jacques Pansiot, Dominique Grad
115
Voted
TC
1998
15 years 3 months ago
Optimal Elections in Faulty Loop Networks and Applications
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
Bernard Mans, Nicola Santoro