Sciweavers

Share
CORR
2006
Springer
114views Education» more  CORR 2006»
8 years 11 months ago
A Java Based Architecture of P2P-Grid Middleware
During the last decade there has been a huge interest in Grid technologies, and numerous Grid projects have been initiated with various visions of the Grid. While all these visions...
Benoit Hudzia, Tariq N. Ellahi, Liam McDermott, M....
CORR
2006
Springer
119views Education» more  CORR 2006»
8 years 11 months ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper
CORR
2006
Springer
146views Education» more  CORR 2006»
8 years 11 months ago
The Haar Wavelet Transform of a Dendrogram
While there is a very long tradition of approximating a data array by projecting row or column vectors into a lower dimensional subspace the direct approximation of a data matrix ...
Fionn Murtagh
CORR
2006
Springer
97views Education» more  CORR 2006»
8 years 11 months ago
Heap Reference Analysis Using Access Graphs
Uday P. Khedker, Amitabha Sanyal, Amey Karkare
CORR
2006
Springer
128views Education» more  CORR 2006»
8 years 11 months ago
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
Gregory Gutin, Arash Rafiey, Anders Yeo
CORR
2006
Springer
81views Education» more  CORR 2006»
8 years 11 months ago
Radial Structure of the Internet
Petter Holme, Josh Karlin, Stephanie Forrest
CORR
2006
Springer
95views Education» more  CORR 2006»
8 years 11 months ago
The computational power of population protocols
We consider the model of population protocols introduced by Angluin et al. [AAD+ 04], in which anonymous finite-state agents stably compute a predicate of the multiset of their in...
Dana Angluin, James Aspnes, David Eisenstat, Eric ...
CORR
2006
Springer
154views Education» more  CORR 2006»
8 years 11 months ago
How Hard Is Bribery in Elections?
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
CORR
2006
Springer
146views Education» more  CORR 2006»
8 years 11 months ago
Oblivious-Transfer Amplification
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
Jürg Wullschleger
CORR
2006
Springer
119views Education» more  CORR 2006»
8 years 11 months ago
Broadcast Cooperation Strategies for Two Colocated Users
This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocati...
Avi Steiner, Amichai Sanderovich, Shlomo Shamai
books