648 search results - page 50 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
COMBINATORICA
2010
13 years 2 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
In Proc. of IEEE Conf. on CVPR'2000, Vol.I, pp.222-227, Hilton Head Island, SC, 2000 In many vision applications, the practice of supervised learning faces several difficulti...