198 search results - page 6 / 40 » On Extremal Cases of Hopcroft's Algorithm |
EVOW
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. Many evolutionary algorithm applications involve either fitness functions with high time complexity or large dimensionality (hence very many fitness evaluations will typi...
SPAA
2000
ACM
13 years 11 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
ICPPW
2006
IEEE
14 years 1 months ago
2006
IEEE
A motion panorama is an efficient and compact representation of the underlying video. However, the motion panorama construction process is computationally intensive and hence extr...
IPCO
2008
13 years 8 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
NIPS
2008
13 years 8 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...