Sciweavers

292 search results - page 1 / 59
» Objects Shared by Byzantine Processes
Sort
View
WDAG
2000
Springer
97views Algorithms» more  WDAG 2000»
13 years 8 months ago
Objects Shared by Byzantine Processes
Work to date on algorithms for message-passing systems has explored a wide variety of types of faults, but corresponding work on shared memory systems has usually assumed that only...
Dahlia Malkhi, Michael Merritt, Michael K. Reiter,...
ICDCS
2006
IEEE
13 years 11 months ago
Sharing Memory between Byzantine Processes using Policy-Enforced Tuple Spaces
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...
Alysson Neves Bessani, Joni da Silva Fraga, Miguel...
EUROSYS
2011
ACM
12 years 8 months ago
Increasing performance in byzantine fault-tolerant systems with on-demand replica consistency
Traditional agreement-based Byzantine fault-tolerant (BFT) systems process all requests on all replicas to ensure consistency. In addition to the overhead for BFT protocol and sta...
Tobias Distler, Rüdiger Kapitza
NIPS
2008
13 years 6 months ago
Shared Segmentation of Natural Scenes Using Dependent Pitman-Yor Processes
We develop a statistical framework for the simultaneous, unsupervised segmentation and discovery of visual object categories from image databases. Examining a large set of manuall...
Erik B. Sudderth, Michael I. Jordan
HCI
2007
13 years 6 months ago
Testing Object Management (TOM): A Prototype for Usability Knowledge Management in Global Software
The collection and sharing of results from usability laboratories around the world has not yet made good use of emerging models of Internetbased knowledge sharing technologies. Thi...
Ian Douglas