153
click to vote
SODA
15 years 10 months ago
2010 ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
171
click to vote
STOC
15 years 10 months ago
2010 ACM 
We ask the question ? how can websites and data aggregators continually release updated statistics, and meanwhile preserve each individual user's privacy? We propose a differ...
205
click to vote
WEA
15 years 8 months ago
2010 Springer 
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
134
click to vote
WEA
15 years 8 months ago
2010 Springer 
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
119
click to vote
SODA
15 years 10 months ago
2010 ACM
We introduce the problem of shape replication in the Wang tile self-assembly model. Given an input shape, we consider the problem of designing a self-assembly system which will re...
|
Algorithms