Sciweavers

352 search results - page 56 / 71
» A local search approximation algorithm for k-means clusterin...
Sort
View
ICCV
2007
IEEE
15 years 3 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
CLUSTER
2008
IEEE
14 years 11 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...
BMCBI
2010
139views more  BMCBI 2010»
14 years 9 months ago
A global optimization algorithm for protein surface alignment
Background: A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined w...
Paola Bertolazzi, Concettina Guerra, Giampaolo Liu...
BMCBI
2005
106views more  BMCBI 2005»
14 years 9 months ago
A multistep bioinformatic approach detects putative regulatory elements in gene promoters
Background: Searching for approximate patterns in large promoter sequences frequently produces an exceedingly high numbers of results. Our aim was to exploit biological knowledge ...
Stefania Bortoluzzi, Alessandro Coppe, Andrea Biso...
ECCV
2006
Springer
15 years 11 months ago
Monocular Tracking of 3D Human Motion with a Coordinated Mixture of Factor Analyzers
Filtering based algorithms have become popular in tracking human body pose. Such algorithms can suffer the curse of dimensionality due to the high dimensionality of the pose state ...
Rui Li, Ming-Hsuan Yang, Stan Sclaroff, Tai-Peng T...