552 search results - page 20 / 111 » Lower bounds for dynamic connectivity |
124
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
141
click to vote
SIAMCOMP
2011
14 years 8 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
140
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
119
click to vote
DGCI
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, a structural property of the set of lozenge tilings of a 2n-gon is highlighted. We introduce a simple combinatorial value called Hamming-distance, which is a lower b...
COCO
2010
Springer
15 years 5 months ago
2010
Springer
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...