608 search results - page 76 / 122 » On Dependent Randomized Rounding Algorithms |
130
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
To take the first step beyond keyword-based search toward entity-based search, suitable token spans ("spots") on documents must be identified as references to real-world...
115
click to vote
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
In this work, the focus is put on the behavior of a system in case a fault occurs that disables the system from executing its applications. Instead of executing a random subset of...
138
click to vote
ASIAN
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present a logic-based framework to evaluate the resilience of computer networks in the face of incidents, i.e., attacks from malicious intruders as well as random faul...
144
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
119
Voted
ICML
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper describes an e cient method for learning the parameters of a Gaussian process (GP). The parameters are learned from multiple tasks which are assumed to have been drawn ...