6575 search results - page 385 / 1315 » Specializing visualization algorithms |
151
click to vote
ICA3PP
2010
Springer
15 years 11 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...
171
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
213
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
183
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
195
click to vote
ARITH
1999
IEEE
1999
IEEE
Correctness Proofs Outline for Newton-Raphson Based Floating-Point Divide and Square Root Algorithms
15 years 11 months ago
This paper describes a study of a class of algorithms for the floating-point divide and square root operations, based on the Newton-Raphson iterative method. The two main goals we...