Sciweavers

GD
2004
Springer
14 years 5 months ago
Layouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
Vida Dujmovic, David R. Wood
PDP
2006
IEEE
14 years 5 months ago
A Coordination-Level Middleware for Supporting Flexible Consistency in CSCW
Highly interactive collaborative applications need to offer each user a consistent view of the interactions represented by the streams exchanged between dispersed groups of users....
Cezar Plesca, Romulus Grigoras, Philippe Qué...
IPPS
2006
IEEE
14 years 5 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
RECOMB
2009
Springer
14 years 6 months ago
Pseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
Sébastien Angibaud, Guillaume Fertin, Annel...