Sciweavers

2145 search results - page 174 / 429
» Pattern-Based Query Answering
Sort
View
135
Voted
COMPGEOM
1997
ACM
15 years 6 months ago
Approximate Nearest Neighbor Queries Revisited
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
Timothy M. Chan
AAAI
2008
15 years 4 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
DEBS
2008
ACM
15 years 4 months ago
On static determination of temporal relevance for incremental evaluation of complex event queries
Evaluation of complex event queries over time involves storing information about those events that are relevant for, i.e., might contribute to, future answers. We call the period ...
François Bry, Michael Eckert
131
Voted
CIDR
2003
134views Algorithms» more  CIDR 2003»
15 years 3 months ago
Approximate Range Selection Queries in Peer-to-Peer Systems
We present an architecture for a data sharing peer-to-peer system where the data is shared in the form of database relations. In general, peer-to-peer systems try to locate exactm...
Abhishek Gupta, Divyakant Agrawal, Amr El Abbadi
PVLDB
2008
120views more  PVLDB 2008»
15 years 2 months ago
On the provenance of non-answers to queries over extracted data
In information extraction, uncertainty is ubiquitous. For this reason, it is useful to provide users querying extracted data with explanations for the answers they receive. Provid...
Jiansheng Huang, Ting Chen, AnHai Doan, Jeffrey F....