664 search results - page 86 / 133 » Some results for a class of generalized polynomials |
150
click to vote
TIT
2002
15 years 6 months ago
2002
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
165
click to vote
FOCS
2007
IEEE
16 years 19 days ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
187
click to vote
IBPRIA
2003
Springer
15 years 11 months ago
2003
Springer
In statistical machine translation, single-word based models have an important deficiency; they do not take contextual information into account for the translation decision. A poss...
167
click to vote
CP
1995
Springer
15 years 10 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
167
click to vote
ICPP
1991
IEEE
15 years 9 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...