10988 search results - page 415 / 2198 » Algorithmic Folding Complexity |
148
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
161
Voted
SODA
1997
ACM
15 years 7 months ago
1997
ACM
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
149
click to vote
CPAIOR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...
163
Voted
ICHIT
2009
Springer
16 years 21 days ago
2009
Springer
The stereo matching algorithms for binocular vision are very popular and widely applied. However, the algorithms may have lower matching quality or higher time complexity. To impr...
151
click to vote
ITNG
2006
IEEE
16 years 4 days ago
2006
IEEE
—In this paper, we address the scheduling problem for Clos-network switches with no buffers at the central stage. Existing scheduling (dispatching) algorithms for this type of sw...