Sciweavers

2899 search results - page 16 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
IBPRIA
2005
Springer
15 years 6 months ago
Color Image Segmentation Using Acceptable Histogram Segmentation
In this paper, a new method for the segmentation of color images is presented. This method searches for an acceptable segmentation of 1D-histograms, according to a “monotone” h...
Julie Delon, Agnès Desolneux, Jose Luis Lis...
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
15 years 10 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
DCC
2004
IEEE
16 years 26 days ago
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
Martin Röder, Jean Cardinal, Raouf Hamzaoui
TNN
2008
102views more  TNN 2008»
15 years 1 months ago
A Class of Complex ICA Algorithms Based on the Kurtosis Cost Function
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost f...
Hualiang Li, Tülay Adali
TCS
2008
15 years 1 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa