11784 search results - page 560 / 2357 » Interpolation for data structures |
195
Voted
PKDD
2005
Springer
16 years 16 days ago
2005
Springer
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
259
click to vote
PODS
1997
ACM
15 years 11 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
181
click to vote
COOPIS
1998
IEEE
15 years 10 months ago
1998
IEEE
There is an increase in the number of data sources that can be queried across the WWW. Such sources typically support HTML forms-based interfaces and search engines query collecti...
187
click to vote
SC
1991
ACM
15 years 10 months ago
1991
ACM
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
200
click to vote
CIKM
2006
Springer
15 years 9 months ago
2006
Springer
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...