699 search results - page 120 / 140 » Generalized Distance Functions in the Theory of Computation |
AI
2011
Springer
14 years 4 months ago
2011
Springer
Qualitative models are often a useful abstraction of the physical world. Learning qualitative models from numerical data sible way to obtain such an abstraction. We present a new ...
SMA
2003
ACM
15 years 3 months ago
2003
ACM
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
129
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...