276 search results - page 18 / 56 » Lower bounds for the complexity of linear functionals in the... |
STOC
1991
ACM
13 years 11 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
JACM
2006
13 years 7 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
ESA
2003
Springer
14 years 21 days ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
COMPGEOM
2004
ACM
14 years 28 days ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
IJCAI
2007
13 years 9 months ago
2007
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...