Sciweavers

3020 search results - page 253 / 604
» Optimal partition trees
Sort
View
COMBINATORICA
2010
15 years 4 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
JCNS
2010
90views more  JCNS 2010»
15 years 1 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
AAAI
2011
14 years 6 months ago
A Scalable Tree-Based Approach for Joint Object and Pose Recognition
Recognizing possibly thousands of objects is a crucial capability for an autonomous agent to understand and interact with everyday environments. Practical object recognition comes...
Kevin Lai, Liefeng Bo, Xiaofeng Ren, Dieter Fox
CVPR
2005
IEEE
16 years 8 months ago
Stereo Correspondence by Dynamic Programming on a Tree
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
Olga Veksler
RECOMB
2009
Springer
16 years 7 months ago
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
Saket Navlakha, James Robert White, Niranjan Nagar...