120 search results - page 18 / 24 » siamcomp 2008 |
SIAMCOMP
2010
14 years 8 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
SIAMCOMP
2010
14 years 8 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
SIAMCOMP
2008
14 years 9 months ago
2008
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...
SIAMCOMP
2008
14 years 9 months ago
2008
Abstract. The Perceptron algorithm, despite its simplicity, often performs well in online classification tasks. The Perceptron becomes especially effective when it is used in conju...
SIAMCOMP
2008
14 years 9 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...