Sciweavers

2228 search results - page 43 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
DAC
2004
ACM
14 years 8 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
CN
2010
136views more  CN 2010»
13 years 7 months ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
ICDM
2003
IEEE
112views Data Mining» more  ICDM 2003»
14 years 1 months ago
Privacy-preserving Distributed Clustering using Generative Models
We present a framework for clustering distributed data in unsupervised and semi-supervised scenarios, taking into account privacy requirements and communication costs. Rather than...
Srujana Merugu, Joydeep Ghosh
CCGRID
2006
IEEE
13 years 11 months ago
IPMI-based Efficient Notification Framework for Large Scale Cluster Computing
The demand for an efficient fault tolerance system has led to the development of complex monitoring infrastructure, which in turn has created an overwhelming task of data and even...
Chokchai Leangsuksun, Tirumala Rao, Anand Tikoteka...
SIGMOD
2003
ACM
163views Database» more  SIGMOD 2003»
14 years 7 months ago
Multi-Dimensional Clustering: A New Data Layout Scheme in DB2
We describe the design and implementation of a new data layout scheme, called multi-dimensional clustering, in DB2 Universal Database Version 8. Many applications, e.g., OLAP and ...
Sriram Padmanabhan, Bishwaranjan Bhattacharjee, Ti...