Sciweavers

2924 search results - page 206 / 585
» Lower Bounds in Distributed Computing
Sort
View
HPCS
2006
IEEE
15 years 9 months ago
Effective Bounds in Euler-Maclaurin-Based Quadrature (Summary for HPCS06)
We analyze the behavior of Euler-Maclaurin-based integration schemes with the intention of deriving accurate and economic estimations of the error. These schemes typically provide...
David H. Bailey, Jonathan M. Borwein
131
Voted
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
15 years 3 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri
ICPADS
2006
IEEE
15 years 9 months ago
Snap-Stabilizing PIF and Useless Computations
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing pr...
Alain Cournier, Stéphane Devismes, Vincent ...
CVPR
2011
IEEE
14 years 11 months ago
Multi-Level Inference by Relaxed Dual Decomposition for Human Pose Segmentation
Combining information from the higher level and the lower level has long been recognized as an essential component in holistic image understanding. However, an efficient inferenc...
Huayan Wang, Daphne Koller
STACS
1994
Springer
15 years 7 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman