536 search results - page 55 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
144
click to vote
ESA
2005
Springer
15 years 11 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...
200
click to vote
PODS
2012
ACM
13 years 8 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
147
click to vote
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
In this paper, we propose a new object-based video coding/transmission system using the emerging Motion JPEG 2000 standard [1] for the efficient storage and delivery of video surve...
186
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
167
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
In this paper we present a new method of interval fuzzy model identification. The method combines a fuzzy identification methodology with some ideas from linear programming theory...