Sciweavers

608 search results - page 76 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
KDD
2009
ACM
209views Data Mining» more  KDD 2009»
14 years 8 months ago
Collective annotation of Wikipedia entities in web text
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...
Sayali Kulkarni, Amit Singh, Ganesh Ramakrishnan, ...
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
14 years 2 months ago
Incorporating graceful degradation into embedded system design
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...
Michael Glaß, Martin Lukasiewycz, Christian ...
ASIAN
2007
Springer
157views Algorithms» more  ASIAN 2007»
14 years 1 months ago
A Logical Framework for Evaluating Network Resilience Against Faults and Attacks
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...
Elie Bursztein, Jean Goubault-Larrecq
WADS
2007
Springer
82views Algorithms» more  WADS 2007»
14 years 1 months ago
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
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...
Prosenjit Bose, Paz Carmi, Mathieu Couture, Michie...
ICML
2004
IEEE
14 years 1 months ago
Learning to learn with the informative vector machine
This paper describes an ecient method for learning the parameters of a Gaussian process (GP). The parameters are learned from multiple tasks which are assumed to have been drawn ...
Neil D. Lawrence, John C. Platt