1529 search results - page 145 / 306 » Querying for meta knowledge |
208
click to vote
COCOON
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
235
click to vote
AAAI
2008
15 years 7 months ago
2008
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
228
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: Once specific genes are identified through high throughput genomics technologies there is a need to sort the final gene list to a manageable size for validation studie...
239
click to vote
SSD
2007
Springer
16 years 17 days ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
207
click to vote
CLEF
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Recent research has suggested that there is no general similarity measure, which can be applied on arbitrary databases without any parameterization. Hence, the optimal co...