2957 search results - page 358 / 592 » The Complexity of Polynomial-Time Approximation |
147
click to vote
FLAIRS
2006
15 years 8 months ago
2006
Sensitivity analysis of Markovian models amounts to computing the constants in polynomial functions of a parameter under study. To handle the computational complexity involved, we...
151
click to vote
VIIP
2001
15 years 8 months ago
2001
Large and complex information requires arbitrarily extensive displays for an exact, comprehensive visualization. This paper introduces a technique, time-multiplexing, for presenti...
167
click to vote
WSC
2004
15 years 8 months ago
2004
Monte Carlo techniques have long been used (since Buffon's experiment to approximate the value of by tossing a needle onto striped paper) to analyze phenomena which, due to ...
166
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
209
click to vote
ENTCS
2006
15 years 6 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...