10608 search results - page 334 / 2122 » Complexity of O'Hara's Algorithm |
99
Voted
SODA
1997
ACM
15 years 2 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...
92
Voted
CPAIOR
2009
Springer
15 years 1 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...
102
click to vote
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
We propose a new fast Feldkamp algorithm for 3-D cone beam tomography with a circular source trajectory. The algorithm is an extension of our recent fast native 2-D fan-beam recon...
ICHIT
2009
Springer
15 years 7 months 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...
103
click to vote
ITNG
2006
IEEE
15 years 6 months 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...