Sciweavers

486 search results - page 67 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
PPOPP
1993
ACM
13 years 11 months ago
Experience with Fine-Grain Synchronization in MIMD Machines for Preconditioned Conjugate Gradient
This paper discusses our experience with fine-grain synchronization for a variant of the preconditioned conjugate gradient method. This algorithm represents a large class of algo...
Donald Yeung, Anant Agarwal
FCT
2007
Springer
13 years 11 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
14 years 1 months ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
ISSRE
2007
IEEE
13 years 9 months ago
Generating Trace-Sets for Model-based Testing
Model-checkers are powerful tools that can find individual traces through models to satisfy desired properties. These traces provide solutions to a number of problems. Instead of...
Birgitta Lindström, Paul Pettersson, Jeff Off...