1879 search results - page 209 / 376 » Computational geometry algorithms library |
139
click to vote
ICFP
2003
ACM
16 years 5 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
149
click to vote
CIAC
1997
Springer
15 years 9 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
147
click to vote
TSI
2008
15 years 5 months ago
2008
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
137
click to vote
KAIS
2007
15 years 5 months ago
2007
Published scientific articles are linked together into a graph, the citation graph, through their citations. This paper explores the notion of similarity based on connectivity alo...
131
click to vote
IJHPCA
2010
15 years 3 months ago
2010
We report on the development of a new computational framework for efficiently carrying out parallel data redistribution in a limited memory environment. This new library, MADRE (T...