Sciweavers

45 search results - page 2 / 9
» Thresholded Covering Algorithms for Robust and Max-min Optim...
Sort
View
ICITS
2011
12 years 7 months ago
Homogeneous Faults, Colored Edge Graphs, and Cover Free Families
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
Yongge Wang, Yvo Desmedt
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 5 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...
ICASSP
2011
IEEE
12 years 8 months ago
Operational performances of a MUSIC algorithm robust to outliers
In operational systems (Radar, communication, sonar,..), for practical considerations the MUSIC pseudo spectrum optimization must be conducted after removing the outliers. When th...
Anne Ferréol, Pascal Larzabal
LREC
2008
133views Education» more  LREC 2008»
13 years 5 months ago
Comparing Set-Covering Strategies for Optimal Corpus Design
This article is interested in the problem of the linguistic content of a speech corpus. Depending on the target task, the phonological and linguistic content of the corpus is cont...
Jonathan Chevelu, Nelly Barbot, Olivier Boëff...
PKC
2005
Springer
93views Cryptology» more  PKC 2005»
13 years 9 months ago
Optimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
Emil Ong, John Kubiatowicz