Sciweavers

151 search results - page 27 / 31
» Derandomized Squaring of Graphs
Sort
View
MSWIM
2006
ACM
14 years 20 days ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
ISAAC
2001
Springer
123views Algorithms» more  ISAAC 2001»
13 years 11 months ago
Labeling Subway Lines
Abstract. Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a pr...
Maria Angeles Garrido, Claudia Iturriaga, Alberto ...
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
13 years 8 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
DCG
2010
171views more  DCG 2010»
13 years 6 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 6 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen