2200 search results - page 372 / 440 » Bloch's Constant is Computable |
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
103
click to vote
NEUROSCIENCE
2001
Springer
15 years 2 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
111
click to vote
SIGGRAPH
1999
ACM
15 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...