7006 search results - page 46 / 1402 » Approximation Algorithms |
CIAC
2006
Springer
14 years 7 days ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
ICASSP
2008
IEEE
14 years 2 months 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...
AICT
2005
IEEE
14 years 2 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...