7930 search results - page 120 / 1586 » Greedy in Approximation Algorithms |
151
click to vote
EOR
2008
15 years 6 months ago
2008
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
144
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we propose an approach for fast pedestrian detection in images. Inspired by the histogram of oriented gradient (HOG) features, a set of multi-scale orientation (MSO...
163
click to vote
AISS
2010
15 years 3 months ago
2010
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
153
click to vote
ICASSP
2008
IEEE
16 years 24 days ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
181
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...