1284 search results - page 140 / 257 » Data Structures for Mergeable Trees |
118
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
134
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
114
click to vote
ACL
1993
15 years 3 months ago
1993
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
114
click to vote
KDD
2002
ACM
16 years 2 months ago
2002
ACM
Images are highly complex multidimensional signals, with rich and complicated information content. For this reason they are difficult to analyze through a unique automated approach...
162
Voted
POPL
2010
ACM
15 years 11 months ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...