Sciweavers

592 search results - page 70 / 119
» Crossing numbers of random graphs
Sort
View
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 8 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
INFOCOM
2008
IEEE
14 years 2 months ago
Swarming on Optimized Graphs for n-Way Broadcast
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
Georgios Smaragdakis, Azer Bestavros, Nikolaos Lao...
ALT
2010
Springer
13 years 3 months ago
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
Balázs Csanád Csáji, Rapha&eu...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 8 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
FOCS
2006
IEEE
14 years 2 months ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner