Sciweavers

1594 search results - page 14 / 319
» Fast Prediction on a Tree
Sort
View
ICC
2007
IEEE
14 years 2 months ago
A Fast Broadcast Tree Construction in Multi-Rate Wireless Mesh Networks
— One of the wireless mesh network’s important features is each node can support more than one transmission rate. However, few previous literatures on the broadcast tree constr...
Tai Wang, Xu Du, Wenqing Cheng, Zongkai Yang, Wei ...
ICML
2010
IEEE
13 years 9 months ago
Random Spanning Trees and the Prediction of Weighted Graphs
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
TCAD
2008
119views more  TCAD 2008»
13 years 7 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong
ECCV
2006
Springer
14 years 9 months ago
Fast, Quality, Segmentation of Large Volumes - Isoperimetric Distance Trees
For many medical segmentation tasks, the contrast along most of the boundary of the target object is high, allowing simple thresholding or region growing approaches to provide near...
Leo Grady
ICCV
2007
IEEE
14 years 9 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas