196 search results - page 24 / 40 » Approximating weighted matchings in parallel |
129
click to vote
ICALP
2011
Springer
14 years 1 months 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 ...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
PODC
2006
ACM
15 years 3 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
GRID
2003
Springer
15 years 2 months ago
2003
Springer
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
As a global feature of fingerprint, orientation field is very important to automatic fingerprint identification system (AFIS). Establishing an accurate and concise model for orien...