Sciweavers

3049 search results - page 50 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 6 months ago
On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stab...
Ankan Saha, Ambuj Tewari
EOR
2008
162views more  EOR 2008»
15 years 6 months ago
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
Given arbitrary source and target nodes s, t and an s
Benedicte Vatinlen, Fabrice Chauvet, Philippe Chr&...
147
Voted
DAGM
2004
Springer
15 years 9 months ago
MinOver Revisited for Incremental Support-Vector-Classification
The well-known and very simple MinOver algorithm is reformulated for incremental support vector classification with and without kernels. A modified proof for its O(t-1/2 ) converge...
Thomas Martinetz
ECAL
2005
Springer
15 years 11 months ago
On Convergence of Dynamic Cluster Formation in Multi-agent Networks
Efficient hierarchical architectures for reconfigurable and adaptive multi-agent networks require dynamic cluster formation among the set of nodes (agents). In the absence of cen...
Mikhail Prokopenko, Piraveenan Mahendra rajah, Pet...
INFOCOM
1999
IEEE
15 years 10 months ago
Scalable Flow Control for Multicast ABR Services
We propose a flow-control scheme for multicast ABR services in ATM networks. At the heart of the proposed scheme is an optimal secondorder rate control algorithm, called the -contr...
Xi Zhang, Kang G. Shin, Debanjan Saha, Dilip D. Ka...