Sciweavers

69 search results - page 13 / 14
» Proximity Algorithms for Nearly-Doubling Spaces
Sort
View
CIVR
2007
Springer
180views Image Analysis» more  CIVR 2007»
14 years 1 months ago
Probabilistic matching and resemblance evaluation of shapes in trademark images
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
Helmut Alt, Ludmila Scharf, Sven Scholz
SIGIR
2006
ACM
14 years 1 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
PREMI
2005
Springer
14 years 1 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
BMCBI
2005
119views more  BMCBI 2005»
13 years 7 months ago
The distance-profile representation and its application to detection of distantly related protein families
Background: Detecting homology between remotely related protein families is an important problem in computational biology since the biological properties of uncharacterized protei...
Chin-Jen Ku, Golan Yona
CVPR
2004
IEEE
14 years 9 months ago
From Fragments to Salient Closed Boundaries: An In-Depth Study
This paper conducts an in-depth study on a classical perceptual-organization problem: finding salient closed boundaries from a set of boundary fragments detected in a noisy image....
Song Wang, Jun Wang, Toshiro Kubota