Sciweavers

322 search results - page 10 / 65
» On the Complexity of Reverse Similarity Search
Sort
View
ESWS
2009
Springer
13 years 5 months ago
Concept Search
Concept Search extends syntactic search, i.e., search based on the computation of string similarity between words, with semantic search, i.e., search based on the computation of s...
Fausto Giunchiglia, Uladzimir Kharkevich, Ilya Zai...
ICDE
2009
IEEE
180views Database» more  ICDE 2009»
14 years 9 months ago
Reverse Furthest Neighbors in Spatial Databases
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
Bin Yao, Feifei Li, Piyush Kumar
TKDE
2010
200views more  TKDE 2010»
13 years 5 months ago
Incremental and General Evaluation of Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
SIGSOFT
2005
ACM
14 years 1 months ago
Detecting higher-level similarity patterns in programs
Cloning in software systems is known to create problems during software maintenance. Several techniques have been proposed to detect the same or similar code fragments in software...
Hamid Abdul Basit, Stan Jarzabek
RECOMB
2008
Springer
14 years 7 months ago
Perfect DCJ Rearrangement
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
Sèverine Bérard, Annie Chateau, Cedr...