3049 search results - page 92 / 610 » On the Convergence of Bound Optimization Algorithms |
148
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
146
click to vote
SODA
2008
ACM
15 years 5 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 [...
134
click to vote
ICARIS
2003
Springer
15 years 9 months ago
2003
Springer
This paper presents a real-valued negative selection algorithm with good mathematical foundation that solves some of the drawbacks of our previous approach [11]. Specifically, it ...
153
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
145
click to vote
TON
2010
15 years 2 months ago
2010
— We adopt the network coding approach to achieve minimum-cost multicast in interference-limited wireless networks where link capacities are functions of the signal-to-noise-plus...