Sciweavers

3658 search results - page 256 / 732
» An Approach To Data Distributions in Chapel
Sort
View
KDD
2007
ACM
137views Data Mining» more  KDD 2007»
16 years 7 months ago
Characterising the difference
Characterising the differences between two databases is an often occurring problem in Data Mining. Detection of change over time is a prime example, comparing databases from two b...
Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
IPPS
1999
IEEE
15 years 11 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
EWSN
2007
Springer
16 years 6 months ago
RIDA: A Robust Information-Driven Data Compression Architecture for Irregular Wireless Sensor Networks
Abstract. In this paper, we propose and evaluate RIDA, a novel informationdriven architecture for distributed data compression in a sensor network, allowing it to conserve energy a...
Xuan Thanh Dang, Nirupama Bulusu, Wu-chi Feng
DAIS
2003
15 years 8 months ago
DataWarp: Building Applications Which Make Progress in an Inconsistent World
Some of the data available to today’s enterprise applications is inconsistent. This is an inevitable consequence of data being distributed and partially replicated in many locati...
Peter Henderson, Robert John Walters, Stephen Crou...
DCOSS
2006
Springer
15 years 11 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...