1695 search results - page 68 / 339 » Linear, Polynomial or Exponential |
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
XCSF is the extension of XCS in which classifier prediction is computed as a linear combination of classifier inputs and a weight vector associated to each classifier. XCSF can...
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
191
click to vote
SIAMCOMP
2011
14 years 3 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
109
click to vote
COCO
2007
Springer
15 years 7 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...