142 search results - page 20 / 29 » Approximate maximum weight branchings |
128
click to vote
ICALP
2011
Springer
14 years 29 days ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
INFOCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
STOC
2005
ACM
15 years 3 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
ACL
2006
14 years 11 months ago
2006
In this paper, we explore correlation of dependency relation paths to rank candidate answers in answer extraction. Using the correlation measure, we compare dependency relations o...
IJON
1998
14 years 9 months ago
1998
The method presented here is aimed to a direct fast setting of the parameters of a RBF network for function approximation. It is based on a hierarchical gridding of the input spac...