1518 search results - page 245 / 304 » Exact and Approximate Bandwidth |
159
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spre...
119
click to vote
UAI
2008
15 years 5 months ago
2008
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
149
click to vote
SODA
2007
ACM
15 years 5 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
162
click to vote
AIPS
2006
15 years 5 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
163
click to vote
UAI
2001
15 years 5 months ago
2001
In this paper we present a method of computing the posterior probability of conditional independence of two or more continuous variables from data, examined at several resolutions...