Sciweavers

2188 search results - page 201 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
ICDM
2003
IEEE
154views Data Mining» more  ICDM 2003»
15 years 9 months ago
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery...
Mukund Deshpande, Michihiro Kuramochi, George Kary...
137
Voted
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
15 years 8 months ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret
VISUALIZATION
2000
IEEE
15 years 8 months ago
Six degree-of-freedom haptic display of polygonal models
: We present an algorithm for haptic display of moderately complex polygonal models with a six degree of freedom (DOF) force feedback device. We make use of incremental algorithms ...
Arthur D. Gregory, Ajith Mascarenhas, Stephen A. E...
COMPGEOM
2008
ACM
15 years 5 months ago
Reeb spaces of piecewise linear mappings
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
Herbert Edelsbrunner, John Harer, Amit K. Patel
165
Voted
CCCG
2008
15 years 5 months ago
Partial Matching of Planar Polygons Under Translation and Rotation
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
Eric McCreath