752 search results - page 129 / 151 » Faster approximation algorithms for the minimum latency prob... |
SSDBM
1999
IEEE
13 years 11 months ago
1999
IEEE
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
WSCG
2004
13 years 8 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
CPM
2000
Springer
13 years 11 months ago
2000
Springer
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
WAIM
2007
Springer
14 years 1 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...