Sciweavers

4378 search results - page 677 / 876
» On the Complexity of Ordered Colourings
Sort
View
JACM
2002
94views more  JACM 2002»
15 years 6 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
CGF
1999
125views more  CGF 1999»
15 years 6 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
CN
1999
74views more  CN 1999»
15 years 6 months ago
FIPA-compliant agents for real-time control of Intelligent Network traffic
Autonomy, adaptability, scalability, and flexible communications are all attributes of agents and multi-agent systems which suggest that they may offer timely solutions for dealin...
Brendan Jennings, Rob Brennan, Rune Gustavsson, Ro...
DAM
1999
128views more  DAM 1999»
15 years 6 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
JDM
1998
101views more  JDM 1998»
15 years 6 months ago
Fault-Tolerant Quorum Consensus Scheme for Replication Control in Mobile Distributed Database Systems
We propose a new replication control scheme for multiple-copy consistency in mobile distributed database systems. Replicating data at multiple sites could contribute to enhance th...
Siwoo Byun, Songchun Moon