1040 search results - page 123 / 208 » Rounding algorithms for covering problems |
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Previous studies have highlighted the high arrival rate of new content on the web. We study the extent to which this new content can be efficiently discovered by a crawler. Our st...
101
click to vote
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
TOC
2008
14 years 9 months ago
2008
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Evolutionary computation is used to construct undetectable computer attack scripts. Using a simulated operating system, we show that scripts can be evolved to cover their tracks a...