10608 search results - page 199 / 2122 » Complexity of O'Hara's Algorithm |
ICCAD
1995
IEEE
14 years 2 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
BMVC
1998
14 years 3 days ago
1998
Evaluating the performance of optical flow algorithms has been difficult because of the lack of ground-truth data sets for complex scenes. We describe a simple modification to a r...
MMSP
2008
IEEE
14 years 5 months ago
2008
IEEE
—In order to compensate for the temporally changing effect of aliasing and improve the coding efficiency of video coders, adaptive interpolation filtering schemes have been recen...
ESA
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
WEA
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...