1871 search results - page 244 / 375 » The Ephemeral Pairing Problem |
170
click to vote
GD
2007
Springer
16 years 20 days ago
2007
Springer
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...
190
click to vote
BIBE
2005
IEEE
16 years 4 days ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
188
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
147
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
198
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...