172 search results - page 28 / 35 » The Complexity of Unions of Disjoint Sets |
NETWORKING
2007
13 years 9 months ago
2007
In this paper, we study the problem of how to design overlay topologies in multi-hop wireless networks such that the overlays achieve perfect resilience, in terms of all cooperativ...
CLEF
2009
Springer
13 years 8 months ago
2009
Springer
In biological sequence processing, Multiple Sequence Alignment (MSA) techniques capture information about long-distance dependencies and the three-dimensional structure of protein ...
IVC
2007
13 years 7 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
SIGGRAPH
2010
ACM
14 years 5 days ago
2010
ACM
This paper addresses the fundamental problem of computing stable medial representations of 3D shapes. We propose a spatially adaptive classification of geometric features that yi...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...