2233 search results - page 113 / 447 » On the Complexity of Theory Curbing |
173
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set i...
165
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
189
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
247
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
205
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...