Sciweavers

3420 search results - page 148 / 684
» Proximity Search in Databases
Sort
View
OZCHI
2006
ACM
14 years 4 months ago
InfoScent evaluator: a semi-automated tool to evaluate semantic appropriateness of hyperlinks in a web site
In this paper, we present InfoScent Evaluator, a tool that automatically evaluates the semantic appropriateness of the descriptions of hyperlinks in web pages. The tool is based o...
Christos Katsanos, Nikolaos K. Tselios, Nikolaos M...
ECCV
2010
Springer
14 years 3 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
CIKM
2001
Springer
14 years 2 months ago
Approaches to Collection Selection and Results Merging for Distributed Information Retrieval
We have investigated two major issues in Distributed Information Retrieval (DIR), namely: collection selection and search results merging. While most published works on these two ...
Yves Rasolofo, Faiza Abbaci, Jacques Savoy
DL
1997
Springer
117views Digital Library» more  DL 1997»
14 years 2 months ago
Evaluating the Cost of Boolean Query Mapping
Non-uniform query languages make searching over heterogeneous information sources difficult. Our approach is to allow a user to compose Boolean queries in one rich front-end lang...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
ECCV
2010
Springer
14 years 1 months ago
Optimal Contour Closure by Superpixel Grouping
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...