Sciweavers

289 search results - page 21 / 58
» Simple COMA Node Implementations
Sort
View
DMG
2005
Springer
14 years 2 months ago
An Adaptive Distributed Query Processing Grid Service
Grid services provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. We are developing a data grid s...
Fabio Porto, Vinícius F. V. da Silva, M&aac...
SPIRE
2005
Springer
14 years 2 months ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel
FIMI
2003
95views Data Mining» more  FIMI 2003»
13 years 10 months ago
Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
Attila Gyenesei, Jukka Teuhola
EUROPAR
2009
Springer
14 years 3 months ago
Adaptive Peer Sampling with Newscast
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
Norbert Tölgyesi, Márk Jelasity
CISS
2007
IEEE
14 years 3 months ago
Collector Receiver Design for Data Collection and Localization in Sensor-driven Networks
— We consider a sensor network in which the sensors communicate at will when they have something to report, without prior coordination with other sensors or with data collection ...
Bharath Ananthasubramaniam, Upamanyu Madhow