196 search results - page 21 / 40 » Approximating weighted matchings in parallel |
110
click to vote
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
PODC
2006
ACM
15 years 3 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
ALGORITHMICA
2002
14 years 9 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
PAA
2008
14 years 9 months ago
2008
We present the study of a data-driven motion synthesis approach based on a 1D affine imagematching equation. We start by deriving the relevant properties of the exact matching oper...
IDEAL
2004
Springer
15 years 3 months ago
2004
Springer
AURA (Advanced Uncertain Reasoning Architecture) is a parallel pattern matching technology intended for high-speed approximate search and match operations on large unstructured dat...