7006 search results - page 596 / 1402 » Approximation Algorithms |
184
click to vote
CIC
2004
15 years 8 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
185
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
194
click to vote
NIPS
1998
15 years 8 months ago
1998
The Expectation Maximization EM algorithm is an iterative procedure for maximum likelihood parameter estimation from data sets with missing or hidden variables 2 . It has been app...
202
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
In reinforcement learning, least-squares temporal difference methods (e.g., LSTD and LSPI) are effective, data-efficient techniques for policy evaluation and control with linear v...
209
click to vote
SBCCI
2003
ACM
16 years 13 days ago
2003
ACM
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...