79 search results - page 5 / 16 » Worst-case analysis of generalized heapsort algorithm revisi... |
STACS
2004
Springer
14 years 21 days ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
COMPGEOM
2009
ACM
14 years 1 days ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
SIGCSE
2004
ACM
14 years 24 days ago
2004
ACM
Many algorithm visualizations have been created, but little is known about which features are most important to their success. We believe that pedagogically useful visualizations ...
ICALP
1993
Springer
13 years 11 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...