Sciweavers

783 search results - page 65 / 157
» Improved approximation algorithms for the freeze-tag problem
Sort
View
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
14 years 3 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
ICASSP
2011
IEEE
13 years 14 days ago
Langevin and hessian with fisher approximation stochastic sampling for parameter estimation of structured covariance
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...
Cornelia Vacar, Jean-François Giovannelli, ...
EOR
2008
107views more  EOR 2008»
13 years 8 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
14 years 3 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
JCO
2000
116views more  JCO 2000»
13 years 8 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
Piotr Berman, Bhaskar DasGupta