Sciweavers

4137 search results - page 99 / 828
» On the number of matchings of a tree
Sort
View
INFOCOM
2003
IEEE
15 years 11 months ago
On Multicast Trees: Structure and Size Estimation
Abstract— This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and r...
Danny Dolev, Osnat Mokryn, Yuval Shavitt
ICPR
2006
IEEE
16 years 7 months ago
Bin-Picking based on Harmonic Shape Contexts and Graph-Based Matching
In this work we address the general bin-picking problem where 3D data is available. We apply Harmonic Shape Contexts (HSC) features since these are invariant to translation, scale...
Jakob Kirkegaard, Thomas B. Moeslund
AAAI
1990
15 years 7 months ago
What Should Be Minimized in a Decision Tree?
In this paper, we address the issue of evaluating decision trees generated from training examples by a learning algorithm. We give a set of performance measures and show how some ...
Usama M. Fayyad, Keki B. Irani
GD
2008
Springer
15 years 7 months ago
Tree Drawings on the Hexagonal Grid
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of dir...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
DATE
2006
IEEE
85views Hardware» more  DATE 2006»
16 years 15 days ago
Optimizing high speed arithmetic circuits using three-term extraction
Carry Save Adder (CSA) trees are commonly used for high speed implementation of multi-operand additions. We present a method to reduce the number of the adders in CSA trees by ext...
Anup Hosangadi, Farzan Fallah, Ryan Kastner