Results 1  10
of
384,521
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 674 (15 self)
 Add to MetaCart
. For each experimental run, we first gen erated random CPTs. We then sampled from the joint distribution defined by the network and clamped the observed nodes (all nodes in the bottom layer) to their sampled value. Given a structure and observations, we then ran three inference algorithms junction tree
Faster generation of random spanning trees
"... Abstract — In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative (1 + δ) of uniform in expected time e O(m √ n log 1/δ). This improves the sparse graph c ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
Abstract — In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative (1 + δ) of uniform in expected time e O(m √ n log 1/δ). This improves the sparse graph
Faster
"... turnaround with two rolls. Produce high quality, longlasting prints with ease using the multiroll HP Designjet Z5400 PostScript ePrinter. With two rolls and automatic media switching, the Z5400 keeps your operations ultraefficient. And there’s no limit to what you can create: POS posters, photos, ..."
Abstract
 Add to MetaCart
turnaround with two rolls. Produce high quality, longlasting prints with ease using the multiroll HP Designjet Z5400 PostScript ePrinter. With two rolls and automatic media switching, the Z5400 keeps your operations ultraefficient. And there’s no limit to what you can create: POS posters, photos, canvases, backlit prints, indoor signs, line drawings, maps all with the quality and durability to impress your customers. So not only will the HP Designjet Z5400 build your business, it will build your reputation. Find out more at hp.com/go/designjetZ5400 Play the video to discover more.
PERFECT SAMPLING OF RANDOM SPANNING TREES
"... Let G be a weighted directed graph where the edge weights are nonnegative real numbers. An arborescence or (directed) spanning tree with root r is a connected subgraph of G such that there is a unique directed path from v to r for each v ∈ V (G). The weight of a spanning tree T will be the product ..."
Abstract
 Add to MetaCart
Let G be a weighted directed graph where the edge weights are nonnegative real numbers. An arborescence or (directed) spanning tree with root r is a connected subgraph of G such that there is a unique directed path from v to r for each v ∈ V (G). The weight of a spanning tree T will be the product
Expanders via Random Spanning Trees
"... Motivatedbytheproblemofroutingreliablyandscalablyinagraph, weintroducethenotion of a splicer, the union of a small number of spanning trees of a graph. We prove that for any boundeddegreenvertexgraph, theunionoftwouniformlyrandomspanningtreesapproximates the expansion of the graph to within a fact ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
factor of O(logn). For the complete graph, we prove that the union of two uniformly random spanning trees is an expander with high probability. For the random graph Gn,p, for p = Ω(logn/n), we give a randomized algorithm for constructing two spanning trees whose union is an expander. A closely related
Faster Cover Trees
"... The cover tree data structure speeds up exact nearest neighbor queries over arbitrary metric spaces (Beygelzimer et al., 2006). This paper makes cover trees even faster. In particular, we provide 1. A simpler definition of the cover tree that reduces the number of nodes from O(n) to exactly n, 2. An ..."
Abstract
 Add to MetaCart
The cover tree data structure speeds up exact nearest neighbor queries over arbitrary metric spaces (Beygelzimer et al., 2006). This paper makes cover trees even faster. In particular, we provide 1. A simpler definition of the cover tree that reduces the number of nodes from O(n) to exactly n, 2
spanning
"... Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling ..."
Abstract
 Add to MetaCart
Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling
spanning
"... Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling ..."
Abstract
 Add to MetaCart
Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling
spanning
"... Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling ..."
Abstract
 Add to MetaCart
Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling
FasterthanSIFT Object Detection
, 2009
"... As computers become more powerful and video processing schemes improve, the problem of efficiently organizing and searching through videos becomes increasingly important. While the question of searching for objects in preprocessed or indexed videos is an important one, so is the problem of searching ..."
Abstract
 Add to MetaCart
As computers become more powerful and video processing schemes improve, the problem of efficiently organizing and searching through videos becomes increasingly important. While the question of searching for objects in preprocessed or indexed videos is an important one, so is the problem of searching for objects in realtime video that has not been indexed. This question of searching
Results 1  10
of
384,521