481 search results - page 65 / 97 » Approximate XML Query Answers |
MICAI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
ASUNAM
2011
IEEE
12 years 7 months ago
2011
IEEE
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
NIPS
2004
13 years 9 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
CIKM
2003
Springer
14 years 29 days ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...