2200 search results - page 319 / 440 » Bloch's Constant is Computable |
160
click to vote
GD
2005
Springer
15 years 11 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
135
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
180
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
150
click to vote
PCI
2005
Springer
15 years 11 months ago
2005
Springer
Nowadays, the number of protein sequences being stored in central protein databases from labs all over the world is constantly increasing. From these proteins only a fraction has b...
158
click to vote
PVM
2005
Springer
15 years 11 months ago
2005
Springer
We present design and implementation details as well as performance results for two new parallel checkpointing libraries developed by us for parallel MPI applications. The first o...