Sciweavers

1612 search results - page 194 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
SAC
2010
ACM
15 years 9 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
ICPP
2005
IEEE
15 years 8 months ago
Push-Pull: Guided Search DAG Scheduling for Heterogeneous Clusters
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
Sang Cheol Kim, Sunggu Lee
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 6 months ago
Gossip PCA
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...
Satish Babu Korada, Andrea Montanari, Sewoong Oh
ISBI
2008
IEEE
16 years 3 months ago
Best individual template selection from deformation tensor minimization
We study the influence of the choice of template in tensorbased morphometry. Using 3D brain MR images from 10 monozygotic twin pairs, we defined a tensor-based distance in the log...
Natasha Lepore, Caroline A. Brun, Yi-Yu Chou, Agat...
131
Voted
MICRO
2008
IEEE
103views Hardware» more  MICRO 2008»
15 years 9 months ago
Testudo: Heavyweight security analysis via statistical sampling
Heavyweight security analysis systems, such as taint analysis and dynamic type checking, are powerful technologies used to detect security vulnerabilities and software bugs. Tradi...
Joseph L. Greathouse, Ilya Wagner, David A. Ramos,...