Sciweavers

2924 search results - page 111 / 585
» Lower Bounds in Distributed Computing
Sort
View
90
Voted
ISPA
2007
Springer
15 years 6 months ago
A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers
The performance of contiguous allocation strategies can be significantly affected by the distribution of job execution times. In this paper, the performance of the existing contigu...
Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ab...
JAIR
2010
119views more  JAIR 2010»
14 years 11 months ago
Active Tuples-based Scheme for Bounding Posterior Beliefs
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any ...
Bozhena Bidyuk, Rina Dechter, Emma Rollon
97
Voted
EUROCRYPT
2010
Springer
15 years 5 months ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...
SIGECOM
2005
ACM
90views ECommerce» more  SIGECOM 2005»
15 years 6 months ago
ICE: an iterative combinatorial exchange
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...
David C. Parkes, Ruggiero Cavallo, Nick Elprin, Ad...
ISTCS
1993
Springer
15 years 4 months ago
Random Walks on Colored Graphs
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and   distinct sets of edges, each of which has a color. A par...
Anne Condon, Diane Hernek