Sciweavers

199 search results - page 17 / 40
» Fast Algorithms for Computing Tree LCS
Sort
View
SAS
2001
Springer
15 years 4 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
CGF
1998
101views more  CGF 1998»
14 years 11 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...
89
Voted
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
15 years 6 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
15 years 5 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
14 years 12 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