2957 search results - page 376 / 592 » The Complexity of Polynomial-Time Approximation |
172
click to vote
COLT
2007
Springer
16 years 21 days ago
2007
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 there ...
162
click to vote
EPEW
2007
Springer
16 years 21 days ago
2007
Springer
Current computer systems and communication networks tend to be highly complex, and they typically hide their internal structure from their users. Thus, for selected aspects of capa...
178
click to vote
ICLP
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
166
click to vote
VLDB
2007
ACM
16 years 19 days ago
2007
ACM
This paper reports our first set of results on managing uncertainty in data integration. We posit that data-integration systems need to handle uncertainty at three levels, and do...
179
click to vote
ICRA
2006
IEEE
16 years 17 days ago
2006
IEEE
— Quasistatic multi-legged locomotion consists of a sequence of equilibrium postures where the mechanism supports itself against gravity while moving free limbs to new positions....