Sciweavers

1399 search results - page 183 / 280
» New Algorithms for k-Center and Extensions
Sort
View
143
Voted
SPIRE
2007
Springer
15 years 11 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
SSD
2007
Springer
131views Database» more  SSD 2007»
15 years 11 months ago
Efficiently Mining Regional Outliers in Spatial Data
With the increasing availability of spatial data in many applications, spatial clustering and outlier detection has received a lot of attention in the database and data mining comm...
Richard Frank, Wen Jin, Martin Ester
141
Voted
WAIM
2007
Springer
15 years 11 months ago
Building Data Synopses Within a Known Maximum Error Bound
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...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
GLVLSI
2006
IEEE
155views VLSI» more  GLVLSI 2006»
15 years 11 months ago
Dynamic voltage scaling for multitasking real-time systems with uncertain execution time
Dynamic voltage scaling (DVS) for real-time systems has been extensively studied to save energy. Previous studies consider the probabilistic distributions of tasks’ execution ti...
Changjiu Xian, Yung-Hsiang Lu
IPPS
2006
IEEE
15 years 11 months ago
Tree-based overlay networks for scalable applications
The increasing availability of high-performance computing systems with thousands, tens of thousands, and even hundreds of thousands of computational nodes is driving the demand fo...
Dorian C. Arnold, G. D. Pack, Barton P. Miller