Sciweavers

37 search results - page 1 / 8
» Scalable Algorithms for String Kernels with Inexact Matching
Sort
View
NIPS
2008
13 years 5 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
COLT
2003
Springer
13 years 9 months ago
Fast Kernels for Inexact String Matching
Christina S. Leslie, Rui Kuang
ICPR
2010
IEEE
13 years 7 months ago
Spatial Representation for Efficient Sequence Classification
We present a general, simple feature representation of sequences that allows efficient inexact matching, comparison and classification of sequential data. This approach, recently ...
Pavel Kuksa, Vladimir Pavlovic
FLAIRS
2006
13 years 5 months ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
HOTOS
2007
IEEE
13 years 8 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer