Sciweavers

444 search results - page 44 / 89
» Erdos-Rado without choice
Sort
View
HPDC
2009
IEEE
13 years 11 months ago
Maestro: a self-organizing peer-to-peer dataflow framework using reinforcement learning
In this paper we describe Maestro, a dataflow computation framework for Ibis, our Java-based grid middleware. The novelty of Maestro is that it is a self-organizing peer-to-peer s...
C. van Reeuwijk
JCM
2008
86views more  JCM 2008»
13 years 7 months ago
Channel Correlation Properties in OFDM by using Time-Varying Cyclic Delay Diversity
This paper analyzes the influence of time-varying cyclic delay diversity (TV-CDD) on the channel fading correlation properties in orthogonal frequency division multiplexing (OFDM) ...
Simon Plass, Armin Dammann, Gerd Richter, Martin B...
FC
2009
Springer
67views Cryptology» more  FC 2009»
13 years 11 months ago
Privacy-Preserving Classifier Learning
We present an efficient protocol for the privacy-preserving, distributed learning of decision-tree classifiers. Our protocol allows a user to construct a classifier on a database h...
Justin Brickell, Vitaly Shmatikov
IJCAI
2003
13 years 9 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...
APAL
2006
64views more  APAL 2006»
13 years 7 months ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký