2957 search results - page 258 / 592 » The Complexity of Polynomial-Time Approximation |
183
click to vote
SSDBM
2000
IEEE
15 years 11 months ago
2000
IEEE
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...
165
click to vote
AAAI
2006
15 years 8 months ago
2006
We show in this paper that the influential algorithm of iterative belief propagation can be understood in terms of exact inference on a polytree, which results from deleting enoug...
120
click to vote
WSC
2004
15 years 8 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
140
click to vote
TWC
2008
15 years 6 months ago
2008
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network o...
197
click to vote
CC
2010
Springer
15 years 4 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...