10988 search results - page 264 / 2198 » Algorithmic Folding Complexity |
134
Voted
ICDCIT
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a n...
151
Voted
ICCAD
1995
IEEE
15 years 7 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 ...
124
Voted
BMVC
1998
15 years 5 months 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...
128
click to vote
MMSP
2008
IEEE
15 years 10 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...
121
Voted
ESA
2005
Springer
15 years 9 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...