Sciweavers

420 search results - page 15 / 84
» Generating random regular graphs
Sort
View
NIPS
2003
13 years 9 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
GLVLSI
2007
IEEE
140views VLSI» more  GLVLSI 2007»
14 years 2 months ago
Structured and tuned array generation (STAG) for high-performance random logic
Regularly structured design techniques can combat complexity on a variety of fronts. We present the Structured and Tuned Array Generation (STAG) design methodology, which provides...
Matthew M. Ziegler, Gary S. Ditlow, Stephen V. Kos...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 9 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
14 years 1 months ago
A Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
Abraham Flaxman, Alan M. Frieze, Juan Vera
ICML
2007
IEEE
14 years 8 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda