Sciweavers

598 search results - page 62 / 120
» A random graph model for massive graphs
Sort
View
CONNECTION
2006
101views more  CONNECTION 2006»
14 years 12 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 1 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 ...
CVPR
2007
IEEE
16 years 1 months ago
Spatio-Temporal Markov Random Field for Video Denoising
This paper presents a novel spatio-temporal Markov random field (MRF) for video denoising. Two main issues are addressed in this paper, namely, the estimation of noise model and t...
Jia Chen, Chi-Keung Tang
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 3 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
TIP
2008
133views more  TIP 2008»
14 years 11 months ago
A Recursive Model-Reduction Method for Approximate Inference in Gaussian Markov Random Fields
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
Jason K. Johnson, Alan S. Willsky