Sciweavers

7006 search results - page 486 / 1402
» Approximation Algorithms
Sort
View
INFOCOM
2003
IEEE
15 years 11 months ago
Robust Monitoring of Link Delays and Faults in IP Networks
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
Yigal Bejerano, Rajeev Rastogi
CORR
2011
Springer
204views Education» more  CORR 2011»
15 years 25 days ago
Accelerated Dual Descent for Network Optimization
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
Michael Zargham, A. Ribeiro, Ali Jadbabaie, Asuman...
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
16 years 28 days ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem
IPCO
2007
108views Optimization» more  IPCO 2007»
15 years 7 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 6 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye