Sciweavers

387 search results - page 18 / 78
» Reasoning About Approximate Match Query Results
Sort
View
SIGIR
1992
ACM
14 years 21 days ago
Classifying News Stories using Memory Based Reasoning
ct tasks such as extraction of relational information from text [Young] [Jacobs]. We describe a method for classifying news stories using Alternative systems [Biebricher] [Lewis] u...
Brij M. Masand, Gordon Linoff, David L. Waltz
SSDBM
2007
IEEE
118views Database» more  SSDBM 2007»
14 years 2 months ago
Database Support for Weighted Match Joins
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
Ameet Kini, Jeffrey F. Naughton
ADC
2006
Springer
136views Database» more  ADC 2006»
14 years 2 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
GIS
2005
ACM
14 years 9 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
ICIW
2008
IEEE
14 years 3 months ago
XML Semantic Filtering via Ontology Reasoning
In this paper, we present an extension of PHIL, a declarative language for filtering information from XML data. The proposed approach allows us to extract relevant data as well a...
Michele Baggi, Moreno Falaschi, Demis Ballis