Sciweavers

2374 search results - page 458 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
GI
2004
Springer
14 years 1 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
AI
2010
Springer
13 years 8 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
WMPI
2004
ACM
14 years 1 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
SIGMOD
2012
ACM
288views Database» more  SIGMOD 2012»
11 years 10 months ago
Exploiting MapReduce-based similarity joins
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Sim...
Yasin N. Silva, Jason M. Reed
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 8 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...