Sciweavers

455 search results - page 24 / 91
» On Trees and Noncrossing Partitions
Sort
View
ICIP
2004
IEEE
15 years 11 months ago
Shape-adaptive coding using binary set splitting with k-d trees
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
James E. Fowler
71
Voted
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 9 months ago
Random Projection Trees Revisited
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
Aman Dhesi, Purushottam Kar
ICIP
2002
IEEE
15 years 11 months ago
Extraction of semantic objects from still images
In this work, we study the extraction of semantic objects from still images. We combine different ideas to extract them in a structured manner together with a perceptual metric th...
Alvaro Pardo
IROS
2006
IEEE
132views Robotics» more  IROS 2006»
15 years 3 months ago
Closing a Million-Landmarks Loop
— We present an improved version of the treemap SLAM algorithm which uses Cholesky factors for representing Gaussians and a Hierarchical Tree Partitioning algorithm derived from ...
Udo Frese, Lutz Schroder
99
Voted
ISAAC
2009
Springer
109views Algorithms» more  ISAAC 2009»
15 years 4 months ago
A Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...