Sciweavers

712 search results - page 19 / 143
» A mixture model for random graphs
Sort
View
FOCS
2003
IEEE
14 years 3 months ago
On Certain Connectivity Properties of the Internet Topology
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
Milena Mihail, Christos H. Papadimitriou, Amin Sab...
DICTA
2003
13 years 11 months ago
A Robust Method for Estimating the Fundamental Matrix
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...
C. L. Feng, Y. S. Hung
COCOA
2008
Springer
14 years 3 days ago
Protean Graphs with a Variety of Ranking Schemes
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
JMLR
2008
141views more  JMLR 2008»
13 years 10 months ago
Graphical Methods for Efficient Likelihood Inference in Gaussian Covariance Models
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
Mathias Drton, Thomas S. Richardson
CPHYSICS
2011
271views Education» more  CPHYSICS 2011»
13 years 1 months ago
A dedicated algorithm for calculating ground states for the triangular random bond Ising model
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
O. Melchert, A. K. Hartmann