10608 search results - page 640 / 2122 » Complexity of O'Hara's Algorithm |
200
click to vote
GD
2005
Springer
16 years 23 days ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
189
click to vote
COMPGEOM
2004
ACM
16 years 20 days ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
220
click to vote
COCO
2004
Springer
16 years 19 days ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
192
click to vote
ISAAC
2004
Springer
16 years 18 days ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
205
click to vote
PKC
2004
Springer
16 years 18 days ago
2004
Springer
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...