Sciweavers

396 search results - page 48 / 80
» Scalability for Clustering Algorithms Revisited
Sort
View
NBIS
2007
Springer
15 years 6 months ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
16 years 1 months ago
Finding Time-Lagged 3D Clusters
Existing 3D clustering algorithms on gene ? sample ? time expression data do not consider the time lags between correlated gene expression patterns. Besides, they either ignore the...
Xin Xu, Ying Lu, Kian-Lee Tan, Anthony K. H. Tung
ISPASS
2003
IEEE
15 years 5 months ago
Performance study of a cluster runtime system for dynamic interactive stream-oriented applications
Emerging application domains such as interactive vision, animation, and multimedia collaboration display dynamic scalable parallelism, and high computational requirements, making ...
Arnab Paul, Nissim Harel, Sameer Adhikari, Bikash ...
SIGIR
2000
ACM
15 years 4 months ago
SWAMI: a framework for collaborative filtering algorithm development and evaluation
We present a Java-based framework, SWAMI (Shared Wisdom through the Amalgamation of Many Interpretations) for building and studying collaborative filtering systems. SWAMI consist...
Danyel Fisher, Kris Hildrum, Jason I. Hong, Mark W...
IPPS
2007
IEEE
15 years 6 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...