Sciweavers

580 search results - page 40 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
JSC
2011
99views more  JSC 2011»
12 years 10 months ago
Sparse polynomial division using a heap
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
Michael B. Monagan, Roman Pearce
ICIP
2009
IEEE
13 years 5 months ago
Real-time optimal-memory image rotation for embedded systems
Skew-corrected document images are necessary for subsequent downstream operations such as archiving, printing or improving OCR performance. Image rotation is a necessary and more ...
Serene Banerjee, Anjaneyulu Kuchibhotla
PODC
2009
ACM
14 years 8 months ago
Randomized mutual exclusion in O(log N / log log N) RMRs
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
Danny Hendler, Philipp Woelfel
DCC
2010
IEEE
13 years 7 months ago
The cost of false alarms in Hellman and rainbow tradeoffs
Abstract Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is kno...
Jin Hong
CGF
2005
106views more  CGF 2005»
13 years 7 months ago
Hierarchical Penumbra Casting
We present a novel algorithm for rendering physically-based soft shadows in complex scenes. Instead of casting shadow rays, we place both the points to be shaded and the samples o...
Samuli Laine, Timo Aila