Sciweavers

2228 search results - page 14 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
ICDE
2007
IEEE
148views Database» more  ICDE 2007»
14 years 9 months ago
Conquering the Divide: Continuous Clustering of Distributed Data Streams
Data is often collected over a distributed network, but in many cases, is so voluminous that it is impractical and undesirable to collect it in a central location. Instead, we mus...
Graham Cormode, S. Muthukrishnan, Wei Zhuang
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
CLUSTER
2002
IEEE
13 years 7 months ago
Open Metadata Formats: Efficient XML-Based Communication for High Performance Computing
High-performance computing faces considerable change as the Internet and the Grid mature. Applications that once were tightly-coupled and monolithic are now decentralized, with co...
Patrick Widener, Greg Eisenhauer, Karsten Schwan, ...
ICDE
2007
IEEE
218views Database» more  ICDE 2007»
14 years 9 months ago
SKYPEER: Efficient Subspace Skyline Computation over Distributed Data
Skyline query processing has received considerable attention in the recent past. Mainly, the skyline query is used to find a set of non dominated data points in a multidimensional...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
13 years 11 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge