10608 search results - page 676 / 2122 » Complexity of O'Hara's Algorithm |
228
Voted
COMPGEOM
2008
ACM
15 years 9 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
187
click to vote
EVOW
2008
Springer
15 years 9 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
198
click to vote
NIPS
2008
15 years 8 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
155
Voted
JCST
2006
15 years 7 months ago
2006
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
209
Voted
JASIS
2007
15 years 7 months ago
2007
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...