828 search results - page 32 / 166 » Bounded Hairpin Completion |
129
click to vote
DAS
2006
Springer
15 years 8 months ago
2006
Springer
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that complete contains the shape. The best-fit bounding...
141
click to vote
ESA
2001
Springer
15 years 8 months ago
2001
Springer
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
125
click to vote
UC
2005
Springer
15 years 9 months ago
2005
Springer
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
122
click to vote
JGT
2008
15 years 4 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
146
click to vote
COMSNETS
2012
14 years 17 hour ago
2012
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...