699 search results - page 120 / 140 » Generalized Distance Functions in the Theory of Computation |
116
click to vote
AI
2011
Springer
14 years 8 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 ...
109
click to vote
SMA
2003
ACM
15 years 6 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...
166
Voted
ICALP
2011
Springer
14 years 5 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...
106
click to vote
FOCS
2007
IEEE
15 years 7 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...
106
click to vote
POPL
2010
ACM
15 years 11 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 ...