791 search results - page 117 / 159 » Approximating the Maximum Sharing Problem |
JCM
2007
13 years 7 months ago
2007
Abstract— Wavelength is one of the most important resources in Wavelength Division Multiplexing(WDM) networks. In optical routing, we are given a set of communication paths (or l...
ALMOB
2006
13 years 8 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...
CPM
2000
Springer
14 years 6 days ago
2000
Springer
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...