Sciweavers

1669 search results - page 96 / 334
» Efficient Data Distribution for DWS
Sort
View
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
14 years 8 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
IPPS
2000
IEEE
14 years 9 days ago
Scalable Parallel Clustering for Data Mining on Multicomputers
This paper describes the design and implementation on MIMD parallel machines of P-AutoClass, a parallel version of the AutoClass system based upon the Bayesian method for determini...
D. Foti, D. Lipari, Clara Pizzuti, Domenico Talia
ADBIS
2000
Springer
97views Database» more  ADBIS 2000»
14 years 8 days ago
An Efficient Storage Manager
When dealing with large quantities of clauses, the use of persistent knowledge is inevitable, and indexing methods are essential to answer queries efficiently. We introduce PerKMan...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
IJWMC
2006
84views more  IJWMC 2006»
13 years 8 months ago
Resilient and energy efficient tracking in sensor networks
: We present a new distributed mechanism for tracking moving objects with a network of sensors. To track such objects efficiently and accurately, we need techniques that allow the ...
Maria Halkidi, Dimitris Papadopoulos, Vana Kaloger...
ICDCS
1996
IEEE
14 years 2 days ago
Larchant: Persistence by Reachability in Distributed Shared Memory Through Garbage Collection
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This ...
Paulo Ferreira, Marc Shapiro