455 search results - page 77 / 91 » On Trees and Noncrossing Partitions |
ICDM
2006
IEEE
14 years 1 months 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...
ISCC
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
3DIM
2005
IEEE
14 years 1 months 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...
BIRTHDAY
2005
Springer
14 years 1 months 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...
SSD
2005
Springer
14 years 1 months 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 ...