Sciweavers

1399 search results - page 115 / 280
» Engineering search computing applications: vision and challe...
Sort
View
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 6 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
ICPR
2006
IEEE
16 years 7 months ago
Invariant Features for 3D-Data based on Group Integration using Directional Information and Spherical Harmonic Expansion
Due to the increasing amount of 3D data for various applications there is a growing need for classification and search in such databases. As the representation of 3D objects is no...
Marco Reisert, Hans Burkhardt
ICCV
2007
IEEE
16 years 21 days 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
BMCBI
2005
134views more  BMCBI 2005»
15 years 6 months ago
Windows .NET Network Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST)
Background: BLAST is one of the most common and useful tools for Genetic Research. This paper describes a software application we have termed Windows .NET Distributed Basic Local ...
Scot E. Dowd, Joaquin Zaragoza, Javier R. Rodrigue...
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
16 years 3 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat