Sciweavers

822 search results - page 41 / 165
» Descendants in Increasing Trees
Sort
View
CATA
2004
13 years 9 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares
FPGA
2008
ACM
168views FPGA» more  FPGA 2008»
13 years 8 months ago
Architectural improvements for field programmable counter arrays: enabling efficient synthesis of fast compressor trees on FPGAs
The Field Programmable Counter Array (FPCA) was introduced to improve FPGA performance for arithmetic circuits. An FPCA is a reconfigurable IP core that can be integrated into an ...
Alessandro Cevrero, Panagiotis Athanasopoulos, Had...
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 6 months ago
Fast Self-Stabilizing Minimum Spanning Tree Construction
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
Lélia Blin, Shlomi Dolev, Maria Potop-Butuc...
ICMCS
2005
IEEE
96views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Quad-Tree Motion Estimation in the Frequency Domain
We propose a quad-tree scheme for obtaining sub-pixel estimates of interframe motion in the frequency domain. Our scheme is based on phase correlation and uses motion compensated ...
Vasileios Argyriou, Theodore Vlachos
ISIPTA
2003
IEEE
102views Mathematics» more  ISIPTA 2003»
14 years 1 months ago
A Sensitivity Analysis for the Pricing of European Call Options in a Binary Tree Model
The European call option prices have well-known formulae in the Cox-RossRubinstein model [2], depending on the volatility of the underlying asset. Nevertheless it is hard to give ...
Huguette Reynaerts, Michèle Vanmaele