2137 search results - page 285 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
147
Voted
LATIN
2010
Springer
15 years 3 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
170
click to vote
SRDS
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
151
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
177
Voted
TDSC
2010
15 years 3 months ago
2010
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
166
click to vote
IPCO
2007
15 years 6 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...