337 search results - page 55 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
FSTTCS
2000
Springer
14 years 23 days ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
COMPLEX
2009
Springer
14 years 1 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
EDBT
2010
ACM
14 years 4 months ago
2010
ACM
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
TCOM
2010
13 years 3 months ago
2010
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...
ACCV
2010
Springer
13 years 4 months ago
2010
Springer
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...