114 search results - page 14 / 23 » Engineering Algorithms for Approximate Weighted Matching |
96
Voted
ICIP
2004
IEEE
16 years 1 months ago
2004
IEEE
We introduce a 3-D parametric active contour algorithm for the shape estimation of DNA molecules from stereo cryo-electron micrographs. We consider a 3-D filament (consisting of a...
INFOCOM
2008
IEEE
15 years 6 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...
115
click to vote
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
As we move from a Web of data to a Web of services, enhancing the capabilities of the current Web search engines with effective and efficient techniques for Web services retrieva...
145
Voted
ICALP
2011
Springer
14 years 3 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 ...
130
click to vote
MOBICOM
2006
ACM
15 years 5 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...