Sciweavers

779 search results - page 12 / 156
» Spectral Generative Models for Graphs
Sort
View
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
14 years 2 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
CORR
2006
Springer
145views Education» more  CORR 2006»
13 years 8 months ago
Product Multicommodity Flow in Wireless Networks
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
Ritesh Madan, Devavrat Shah, Olivier Lév&ec...
SGP
2004
13 years 10 months ago
Spectral Surface Reconstruction From Noisy Point Clouds
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
Ravi Krishna Kolluri, Jonathan Richard Shewchuk, J...
SIGGRAPH
2009
ACM
14 years 2 months ago
Spectral mesh processing
Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out ...
Bruno Lévy, Hao Zhang 0002
PKDD
2005
Springer
155views Data Mining» more  PKDD 2005»
14 years 1 months ago
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...