Sciweavers

1806 search results - page 291 / 362
» Randomness and halting probabilities
Sort
View
NIPS
2001
15 years 5 months ago
The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank
The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by taking into account the link structure of the Web. PageRank assigns to a pa...
Matthew Richardson, Pedro Domingos
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 5 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
SSWMC
2004
15 years 5 months ago
Steganalysis of block-structured stegotext
We study a detection-theoretic approach to steganalysis. The relative entropy between covertext and stegotext determines the steganalyzer's difficulty in discriminating them,...
Ying Wang, Pierre Moulin
UAI
2004
15 years 5 months ago
Convolutional Factor Graphs as Probabilistic Models
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
Yongyi Mao, Frank R. Kschischang, Brendan J. Frey
WSC
1998
15 years 5 months ago
A Comparison of RESTART Implementations
The RESTART method is a widely applicable simulation technique for the estimation of rare event probabilities. The method is based on the idea to restart the simulation in certain...
Marnix J. J. Garvels, Dirk P. Kroese