Sciweavers

6897 search results - page 656 / 1380
» Parallelization of Modular Algorithms
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
Solving the Maximum Clique Problem Using PUBB
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuich...
ASAP
1997
IEEE
106views Hardware» more  ASAP 1997»
15 years 11 months ago
Libraries of schedule-free operators in Alpha
This paper presents a method, based on the formalism of affine recurrence equations, for the synthesis of digital circuits exploiting parallelism at the bit-level. In the initial ...
Florent de Dinechin
CCGRID
2004
IEEE
15 years 10 months ago
Privacy-preserving association rule mining in large-scale distributed systems
Data privacy is a major concern that threatens the widespread deployment of Data Grids in domains such as health-care and finance. We propose a unique approach for obtaining knowl...
Assaf Schuster, Ran Wolff, Bobi Gilburd
CONCUR
2006
Springer
15 years 10 months ago
Probability and Nondeterminism in Operational Models of Concurrency
We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our su...
Roberto Segala
DCOSS
2008
Springer
15 years 8 months ago
Stochastic Counting in Sensor Networks, or: Noise Is Good
We propose a novel algorithm of counting indistinguishable objects by a collection of sensors. The information on multiple counting is recovered from the stochastic correlation pat...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung...