We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...
We address the issue of low-level segmentation of vector-valued images, focusing on the case of color natural images. The proposed approach relies on the formulation of the problem...
Informal conversations occur all day long among employees. These conversations allow employees to share experience such as innovative ideas for performing a task. Internalizing th...
Lori Baker-Eveleth, Suprateek Sarker, Daniel M. Ev...
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
In this paper, a new recursive algorithm is proposed for optimal estimation of similarity measure used in a content-based retrieval system. This is performed through a relevance f...