478 search results - page 53 / 96 » Improving probability bounds by optimization over subsets |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
FORMATS
2007
Springer
14 years 1 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Gray hole attacks (a.k.a selective forwarding attacks) are a special case of denial of service (DoS) attack, where a misbehaving mesh router just forwards a subset of th...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...