Sciweavers

4894 search results - page 884 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 7 months ago
Exact Indexing of Dynamic Time Warping
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
Eamonn J. Keogh
ML
2007
ACM
106views Machine Learning» more  ML 2007»
13 years 7 months ago
Surrogate maximization/minimization algorithms and extensions
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
OL
2007
103views more  OL 2007»
13 years 7 months ago
Support vector machine via nonlinear rescaling method
In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see [9, 11, 10] and references therein). The formulation of t...
Roman A. Polyak, Shen-Shyang Ho, Igor Griva
RAS
2007
102views more  RAS 2007»
13 years 7 months ago
Fast and accurate SLAM with Rao-Blackwellized particle filters
Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter in which each ...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
RSA
2008
103views more  RSA 2008»
13 years 7 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav