We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
We give semantic characterizations of the expressive power of navigational XPath (also called Core XPath) in terms of first order logic. XPath can be used to specify sets of nodes...
This paper addresses the challenge of recognizing dynamic
textures based on their observed visual dynamics.
Typically, the term dynamic texture is used with reference
to image s...
We examine the problem of finding the optimal weight of the fidelity term in variational denoising. Our aim is to maximize the signal to noise ratio (SNR) of the restored image. ...