1158 search results - page 79 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
364
Voted
COCOON
2011
Springer
14 years 4 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
133
click to vote
FOIKS
2008
Springer
15 years 6 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
158
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
125
click to vote
SODA
2001
ACM
15 years 6 months ago
2001
ACM
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
150
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...