196 search results - page 7 / 40 » Approximating weighted matchings in parallel |
78
Voted
PERCOM
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper introduces a “weighted” matching algorithm to estimate a robot’s planar displacement by matching twodimensional range scans. The influence of each scan point on ...
ISMIR
2004
Springer
15 years 3 months ago
2004
Springer
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
111
click to vote
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...