Sciweavers

420 search results - page 42 / 84
» Generating random regular graphs
Sort
View
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 9 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
AAAI
1994
13 years 9 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
RSA
2010
118views more  RSA 2010»
13 years 6 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
GG
2008
Springer
13 years 8 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
CVPR
2010
IEEE
14 years 4 months ago
Vessel Scale Selection using MRF Optimization
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scaleselection algorithms with spatial regularization. To this end, we formula...
Hengameh Mirzaalian, Ghassan Hamarneh