Sciweavers

2899 search results - page 95 / 580
» Dynamic Trees in Practice
Sort
View
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
14 years 1 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
13 years 10 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
Hiroshi Fujiwara, Tobias Jacobs
COMCOM
1998
106views more  COMCOM 1998»
13 years 8 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
CVPR
2011
IEEE
13 years 5 months ago
Scale and Rotation Invariant Matching Using Linearly Augmented Trees
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
Hao Jiang, Tai-Peng Tian, Stan Sclaroff
BIOINFORMATICS
2006
111views more  BIOINFORMATICS 2006»
13 years 9 months ago
Multiple Alignment of protein structures and sequences for VMD
Multiple Alignment is a new interface for performing and analyzing multiple protein structure alignments. It enables viewing levels of sequence and structure similarity on the ali...
John Eargle, Dan Wright, Zaida Luthey-Schulten