Sciweavers

178 search results - page 21 / 36
» Martin's maximum revisited
Sort
View
FAST
2009
14 years 7 months ago
Tiered Fault Tolerance for Long-Term Integrity
Fault-tolerant services typically make assumptions about the type and maximum number of faults that they can tolerate while providing their correctness guarantees; when such a fau...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
IWMM
2011
Springer
270views Hardware» more  IWMM 2011»
14 years 16 days ago
Memory management in NUMA multicore systems: trapped between cache contention and interconnect overhead
Multiprocessors based on processors with multiple cores usually include a non-uniform memory architecture (NUMA); even current 2-processor systems with 8 cores exhibit non-uniform...
Zoltan Majo, Thomas R. Gross
CVPR
2005
IEEE
15 years 11 months ago
Diagram Structure Recognition by Bayesian Conditional Random Fields
Hand-drawn diagrams present a complex recognition problem. Elements of the diagram are often individually ambiguous, and require context to be interpreted. We present a recognitio...
Yuan (Alan) Qi, Martin Szummer, Thomas P. Minka
ECCV
2004
Springer
15 years 11 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
STACS
2010
Springer
15 years 4 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...