455 search results - page 35 / 91 » On Trees and Noncrossing Partitions |
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
DBPL
2007
Springer
14 years 2 months ago
2007
Springer
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
VRST
1997
ACM
13 years 12 months ago
1997
ACM
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
WSCG
2004
13 years 9 months ago
2004
This paper proposes an embedded rate scalable wavelet-based image coding algorithm. We introduce a simple and efficient approach for coding the positions and the signs of the wave...