Sciweavers

276 search results - page 25 / 56
» Fast Algorithm for Stochastic Tree Computation
Sort
View
CGF
1998
101views more  CGF 1998»
13 years 7 months ago
Rapid and Accurate Contact Determination between Spline Models using ShellTrees
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
Shankar Krishnan, M. Gopi, Ming C. Lin, Dinesh Man...
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
14 years 2 months ago
Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches
We present an efficient analog synthesis algorithm employing regression models of circuit matrices. Circuit matrix models achieve accurate and speedy synthesis of analog circuits...
Almitra Pradhan, Ranga Vemuri
COCOON
2005
Springer
14 years 1 months ago
RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer
Horizontal gene transfer (HGT) plays a major role in microbial genome diversification, and is claimed to be rampant among various groups of genes in bacteria. Further, HGT is a ma...
Luay Nakhleh, Derek A. Ruths, Li-San Wang
ECCV
2010
Springer
13 years 7 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
CVPR
2005
IEEE
14 years 9 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