2654 search results - page 401 / 531 » On Pairing Inversion Problems |
152
click to vote
BIBE
2005
IEEE
15 years 10 months 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 ...
154
click to vote
SPAA
2004
ACM
15 years 10 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...
118
click to vote
FOCS
2002
IEEE
15 years 9 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...
160
click to vote
INFOCOM
2002
IEEE
15 years 9 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...
132
click to vote
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...