Sciweavers

1612 search results - page 154 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
149
Voted
ACSD
2008
IEEE
108views Hardware» more  ACSD 2008»
15 years 7 months ago
Modular construction of finite and complete prefixes of Petri net unfoldings
This paper considers distributed systems, defined as a collection of components interacting through interfaces. Components, interfaces and distributed systems are modeled as Petri...
Agnes Madalinski, Eric Fabre
ECCC
2011
282views ECommerce» more  ECCC 2011»
14 years 11 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
15 years 5 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
141
Voted
IPPS
2002
IEEE
15 years 10 months ago
A Parallel Two-Level Hybrid Method for Diagonal Dominant Tridiagonal Systems
A new method, namely the Parallel Two-Level Hybrid (PTH) method, is developed to solve tridiagonal systems on parallel computers. PTH is designed based on Parallel Diagonal Domina...
Xian-He Sun, Wu Zhang
CLUSTER
2004
IEEE
15 years 8 months ago
Towards informatic analysis of Syslogs
The complexity and cost of isolating the root cause of system problems in large parallel computers generally scales with the size of the system. Syslog messages provide a primary ...
John Stearley