Sciweavers

2681 search results - page 8 / 537
» Problem F
Sort
View
SAC
2010
ACM
15 years 7 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...
98
Voted
ISW
2009
Springer
15 years 7 months ago
F3ildCrypt: End-to-End Protection of Sensitive Information in Web Services
The frequency and severity of a number of recent intrusions involving data theft and leakages has shown that online users’ trust, voluntary or not, in the ability of third partie...
Matthew Burnside, Angelos D. Keromytis
COGSCI
2008
90views more  COGSCI 2008»
15 years 8 days ago
Using fMRI to Test Models of Complex Cognition
This article investigates the potential of fMRI to test assumptions about different components in models of complex cognitive tasks. If the components of a model can be associated...
John R. Anderson, Cameron S. Carter, Jon M. Fincha...
70
Voted
ASPDAC
2006
ACM
82views Hardware» more  ASPDAC 2006»
15 years 6 months ago
An exact algorithm for the statistical shortest path problem
Liang Deng, Martin D. F. Wong
72
Voted
IWSOC
2005
IEEE
114views Hardware» more  IWSOC 2005»
15 years 6 months ago
Global Lower Bounds for the VLSI Macrocell Floorplanning Problem Using Semidefinite Optimization
P. L. Takouda, Miguel F. Anjos, Anthony Vannelli