Sciweavers

47 search results - page 7 / 10
» Supporting Ranked Boolean Similarity Queries in MARS
Sort
View
AI
2010
Springer
13 years 6 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
ICDE
2009
IEEE
118views Database» more  ICDE 2009»
14 years 1 months ago
An Incremental Threshold Method for Continuous Text Search Queries
Abstract—A text filtering system monitors a stream of incoming documents, to identify those that match the interest profiles of its users. The user interests are registered at ...
Kyriakos Mouratidis, HweeHwa Pang
BMCBI
2006
195views more  BMCBI 2006»
13 years 6 months ago
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Paul Shafer, Timothy Isganitis, Golan Yona
DKE
2008
96views more  DKE 2008»
13 years 6 months ago
Fragment-based approximate retrieval in highly heterogeneous XML collections
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafa...
SPIRE
2010
Springer
13 years 5 months ago
Dual-Sorted Inverted Lists
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
Gonzalo Navarro, Simon J. Puglisi