2430 search results - page 89 / 486 » Computing Tutte Polynomials |
109
Voted
IVC
2000
15 years 2 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
125
Voted
DAC
2011
ACM
14 years 2 months ago
2011
ACM
Stochastic device noise has become a significant challenge for high-precision analog/RF circuits, and it is particularly difficult to correctly include both white noise and flic...
111
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
92
Voted
CORR
2004
Springer
15 years 2 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
104
click to vote
ICA3PP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...