Sciweavers

124 search results - page 6 / 25
» The Path Length of Binary Trees
Sort
View
EJWCN
2010
115views more  EJWCN 2010»
13 years 2 months ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
14 years 2 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
DMTCS
2010
125views Mathematics» more  DMTCS 2010»
13 years 5 months ago
Binary Labelings for Plane Quadrangulations and their Relatives
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
Stefan Felsner, Clemens Huemer, Sarah Kappes, Davi...
IJAC
2007
89views more  IJAC 2007»
13 years 7 months ago
Bounding Right-Arm Rotation Distances
Abstract. Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to tra...
Sean Cleary, Jennifer Taback
ISCAS
2007
IEEE
96views Hardware» more  ISCAS 2007»
14 years 2 months ago
Novel High-Speed Redundant Binary to Binary converter using Prefix Networks
— Fast addition and multiplication are of paramount importance in many arithmetic circuits and processors. The use of redundant number system for efficient implementation of thes...
Sreehari Veeramachaneni, Kirthi M. Krishna, Lingam...