11395 search results - page 211 / 2279 » Beyond computer science |
152
click to vote
NSDI
2007
15 years 8 months ago
2007
Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantee...
204
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
