62 search results - page 3 / 13 » Are Fibonacci Heaps Optimal |
TCS
2002
13 years 7 months ago
2002
In a heap model, solid blocks, or pieces, pile up according to the Tetris game mechanism. An optimal schedule is an in nite sequence of pieces minimizing the asymptotic growth rat...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, a novel data hiding technique is proposed, as an improvement over the Fibonacci LSB data-hiding technique proposed by Battisti et al. [1] based on decomposition of ...
DC
2010
13 years 7 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
CASCON
2006
13 years 8 months ago
2006
This research studies the characteristics of field usage patterns in the SpecJVM98 benchmarks. It finds that multiple object instances of the same class often exhibit different fi...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper, we present type systems for flow-sensitive pointer analysis, live stack-heap (variables) analysis, and program optimization. The type system for live stack-heap ana...