4516 search results - page 784 / 904 » Data Structures in the Design of Interfaces |
231
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
141
Voted
KDD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we present a technique for visual analysis of documents based on the semantic representation of text in the form of a directed graph, referred to as semantic graph....
130
click to vote
DEXA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
153
click to vote
IPTPS
2005
Springer
15 years 9 months ago
2005
Springer
— We propose here an analysis of a rich dataset which gives an exhaustive and dynamic view of the exchanges processed in a running eDonkey system. We focus on correlation in term...
118
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...