3020 search results - page 376 / 604 » Optimal partition trees |
150
click to vote
ICDM
2006
IEEE
16 years 18 days ago
2006
IEEE
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
173
click to vote
3DIM
2005
IEEE
16 years 6 days ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
157
click to vote
BIRTHDAY
2005
Springer
16 years 3 days ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
192
click to vote
SSD
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
147
click to vote
SAC
2004
ACM
15 years 12 months ago
2004
ACM
In this work we propose a parallel algorithm for the efficient extraction of binding-site consensus from genomic sequences. This algorithm, based on an existing approach, extracts...