569 search results - page 34 / 114 » High Performance Reasoning with Very Large Knowledge Bases |
127
click to vote
TKDE
2012
13 years 2 days ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
107
click to vote
ICS
1995
Tsinghua U.
15 years 1 months ago
1995
Tsinghua U.
Current data cache organizations fail to deliver high performance in scalar processors for many vector applications. There are two main reasons for this loss of performance: the u...
AAAI
2012
13 years 1 days ago
2012
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
JMLR
2008
14 years 9 months ago
2008
A number of today's state-of-the-art planners are based on forward state-space search. The impressive performance can be attributed to progress in computing domain independen...
100
Voted
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...