Sciweavers

3396 search results - page 46 / 680
» Tree representations of graphs
Sort
View
ICIP
2005
IEEE
14 years 2 months ago
Object representation using colour, shape and structure criteria in a binary partition tree
Binary Partition Trees (BPTs) are a well known technique used for region-based image representation and analysis. BPTs are usually created as a result of a merging process based o...
Christian Ferran Bennström, Josep R. Casas
SIGGRAPH
1999
ACM
14 years 1 months ago
LDI Tree: A Hierarchical Representation for Image-Based Rendering
Using multiple reference images in 3D image warping has been a challenging problem. Recently, the Layered Depth Image (LDI) was proposed by Shade et al. to merge multiple referenc...
Chun-Fa Chang, Gary Bishop, Anselmo Lastra
EJC
2006
13 years 8 months ago
On the canonical metric representation, average distance, and partial Hamming graphs
Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometr...
Sandi Klavzar
ICTAI
2003
IEEE
14 years 2 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
CTRSA
2003
Springer
114views Cryptology» more  CTRSA 2003»
14 years 2 months ago
Fractal Merkle Tree Representation and Traversal
We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For...
Markus Jakobsson, Frank Thomson Leighton, Silvio M...