110 search results - page 9 / 22 » A persistent union-find data structure |
ADBIS
2000
Springer
13 years 11 months ago
2000
Springer
When dealing with large quantities of clauses, the use of persistent knowledge is inevitable, and indexing methods are essential to answer queries efficiently. We introduce PerKMan...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
NIPS
2001
13 years 8 months ago
2001
To find out how the representations of structured visual objects depend on the co-occurrence statistics of their constituents, we exposed subjects to a set of composite images wit...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...