7129 search results - page 319 / 1426 » Approximation Algorithms for Treewidth |
111
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
—A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us ...
127
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...
153
click to vote
CPM
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
117
click to vote
ALT
2010
Springer
15 years 6 months ago
2010
Springer
Stability has been explored to study the performance of learning algorithms in recent years and it has been shown that stability is sufficient for generalization and is sufficient ...
152
click to vote
SIAMCOMP
2000
15 years 4 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...