3020 search results - page 9 / 604 » Optimal partition trees |
101
click to vote
ICML
2005
IEEE
16 years 14 days ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
106
click to vote
BNCOD
1997
15 years 1 months ago
1997
Abstract. In this paper we present two improvements to the partitioning process: 1) A new dynamic bu er management strategy is employed to increase the average block size of I/O-tr...
109
click to vote
ICIP
2001
IEEE
16 years 1 months ago
2001
IEEE
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
111
click to vote
VMV
2001
15 years 1 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
105
Voted
ASPDAC
2007
ACM
15 years 3 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...