Sciweavers

5115 search results - page 132 / 1023
» On Randomized Lanczos Algorithms
Sort
View
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
15 years 10 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
WSC
2007
15 years 8 months ago
A method for fast generation of bivariate Poisson random vectors
It is well known that trivariate reduction — a method to generate two dependent random variables from three independent random variables — can be used to generate Poisson rand...
Kaeyoung Shin, Raghu Pasupathy
ICIP
2007
IEEE
16 years 8 months ago
Markov Random Field Model-Based Edge-Directed Image Interpolation
Abstract-- This paper presents an edge-directed image interpolation algorithm. In the proposed algorithm, the edge directions are implicitly estimated with a statistical-based appr...
Min Li, Truong Q. Nguyen
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
16 years 1 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
ICASSP
2007
IEEE
16 years 20 days ago
Markov Random Field Energy Minimization via Iterated Cross Entropy with Partition Strategy
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
Jue Wu, Albert C. S. Chung