Sciweavers

2814 search results - page 94 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 7 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
SPAA
2003
ACM
15 years 7 months ago
On local algorithms for topology control and routing in ad hoc networks
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
Lujun Jia, Rajmohan Rajaraman, Christian Scheidele...
ICASSP
2008
IEEE
15 years 8 months ago
On quantifying the effects of noncircularity on the complex fastica algorithm
The complex fast independent component analysis (c-FastICA) algorithm is one of the most popular methods for solving the ICA problem with complex-valued data. In this study, we ex...
Mike Novey, Tülay Adali
COMPGEOM
2008
ACM
15 years 4 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri
121
Voted
ICPR
2008
IEEE
16 years 3 months ago
Collaborative learning by boosting in distributed environments
In this paper we propose a new distributed learning method called distributed network boosting (DNB) algorithm for distributed applications. The learned hypotheses are exchanged b...
Shijun Wang, Changshui Zhang