438 search results - page 6 / 88 » A Theory of Competitive Analysis for Distributed Algorithms |
ICDCSW
2003
IEEE
14 years 19 days ago
2003
IEEE
In a Distributed Database System (DDBS), transactions on objects can be read requests or write requests in a random manner. The replication algorithm of objects critically affects...
TSP
2008
13 years 7 months ago
2008
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
TSP
2010
13 years 2 months ago
2010
We study the distributed sampling and centralized reconstruction of two correlated signals, modeled as the input and output of an unknown sparse filtering operation. This is akin ...
SYNTHESE
2008
2008
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
13 years 7 months ago
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
PAMI
2011
12 years 10 months ago
2011
Abstract—In this paper, we define meta-recognition, a performance prediction method for recognition algorithms, and examine the theoretical basis for its post-recognition score ...