71 search results - page 12 / 15 » Optimal Distance Bounds on Time-Series Data. |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
ICDM
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper presents the triple jump framework for accelerating the EM algorithm and other bound optimization methods. The idea is to extrapolate the third search point based on th...
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
NIPS
2008
14 years 11 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Wireless sensor networks (WSNs) deployed for missioncritical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes w...