501 search results - page 49 / 101 » Communication Lower Bounds Using Dual Polynomials |
145
Voted
AI
2010
Springer
15 years 2 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
153
Voted
CRYPTO
2008
Springer
15 years 4 months ago
2008
Springer
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
106
Voted
VTC
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—In this contribution the performance of multipleinput multiple-output space-division, code-division multipleaccess (MIMO SCDMA) is investigated, when the low-complexity ...
156
Voted
CCECE
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
107
Voted
CPM
2000
Springer
15 years 7 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...