848 search results - page 31 / 170 » Randomness and the linear degrees of computability |
108
click to vote
CAGD
2008
14 years 12 months ago
2008
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are g...
PPL
2000
14 years 11 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
SIGGRAPH
1996
ACM
15 years 3 months ago
1996
ACM
Current linear-time simulation methods for articulated figures are based exclusively on reduced-coordinate formulations. This paper describes a general, non-iterative linear-time ...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...