12015 search results - page 465 / 2403 » Interactive Algorithms 2005 |
136
click to vote
SPIRE
2005
Springer
15 years 10 months ago
2005
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U, conside...
125
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
192
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
181
click to vote
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Replication of content on geographically distributed servers can improve both performance and reliability of the Web service. Anycast is a one-toone-of-many delivery tech...
139
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
With the exponential reduction in the scaling of feature size, inter-wire coupling capacitance becomes the dominant part of load capacitance. Two problems are introduced by coupli...