2957 search results - page 453 / 592 » The Complexity of Polynomial-Time Approximation |
UC
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Dynamical structure in the brain promotes biological function. Natural scientists look for correlations between measured electrical signals and behavior or mental states....
COCO
2005
Springer
14 years 3 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
XSYM
2004
Springer
14 years 3 months ago
2004
Springer
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
SIGGRAPH
1999
ACM
14 years 2 months ago
1999
ACM
A simple, fast, and approximate voxel-based approach to 6DOF haptic rendering is presented. It can reliably sustain a 1000 Hz haptic refresh rate without resorting to asynchronous...