285 search results - page 18 / 57 » New Ways to Construct Binary Search Trees |
118
click to vote
COCOON
1998
Springer
15 years 3 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...
FSTTCS
1993
Springer
15 years 3 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
108
click to vote
VIROLOGY
2010
14 years 10 months ago
2010
Abstract. This paper gives an overview of our research in the automation of the process of software protection analysis. We will focus more particularly on the problem of obfuscati...
102
click to vote
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
117
click to vote
DEXA
2010
Springer
14 years 9 months ago
2010
Springer
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...