Sciweavers

2080 search results - page 312 / 416
» Measuring empirical computational complexity
Sort
View
ICCV
1999
IEEE
16 years 8 months ago
A Bidirectional Matching Algorithm for Deformable Pattern Detection with Application to Handwritten Word Retrieval
A Bayesian framework for deformable pattern classification has been proposed in [1] with promising results for isolated handwritten character recognition. Its performance, however...
Kwok-Wai Cheung, Dit-Yan Yeung, Roland T. Chin
HAPTICS
2009
IEEE
15 years 9 months ago
Intravascular palpation and haptic feedback during angioplasty
Within the HapCath - haptic catheter - project an assistive system for interventional catheterizations has been developed. Conventional navigation during catheterization is done b...
Thorsten Meiss, Christoph Budelmann, Thorsten Alex...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 6 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
BMCBI
2008
132views more  BMCBI 2008»
15 years 6 months ago
The Average Mutual Information Profile as a Genomic Signature
Background: Occult organizational structures in DNA sequences may hold the key to understanding functional and evolutionary aspects of the DNA molecule. Such structures can also p...
Mark Bauer, Sheldon M. Schuster, Khalid Sayood
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
16 years 15 days ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma