Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysi...
This poster discusses methods to characterize the resilience of networks to a number of challenges and attacks, with the goal of developing quantifiable metrics to determine the de...
Bernhard Plattner, David Hutchison, James P. G. St...
We show that for every α > 0, there exist n-point metric spaces (X, d) where every “scale” admits a Euclidean embedding with distortion at most α, but the whole space req...
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...