2542 search results - page 149 / 509 » Computing Cartograms with Optimal Complexity |
146
Voted
CLUSTER
2006
IEEE
15 years 3 months ago
2006
IEEE
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
126
click to vote
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
128
Voted
DAGSTUHL
2006
15 years 4 months ago
2006
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
122
click to vote
RTS
2000
15 years 3 months ago
2000
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...