Sciweavers

2157 search results - page 286 / 432
» Binary ant algorithm
Sort
View
163
Voted
JSC
2011
99views more  JSC 2011»
14 years 8 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
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 7 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
ICB
2007
Springer
683views Biometrics» more  ICB 2007»
15 years 11 months ago
Face Detection Based on Multi-Block LBP Representation
Effective and real-time face detection has been made possible by using the method of rectangle Haar-like features with AdaBoost learning since Viola and Jones’ work [12]. In this...
Lun Zhang, Rufeng Chu, Shiming Xiang, ShengCai Lia...
132
Voted
CAL
2007
15 years 5 months ago
Physical Register Reference Counting
—Several recently proposed techniques including CPR (Checkpoint Processing and Recovery) and NoSQ (No Store Queue) rely on reference counting to manage physical registers. Howeve...
A. Roth
SIGOPS
2011
215views Hardware» more  SIGOPS 2011»
15 years 1 days ago
Log-based architectures: using multicore to help software behave correctly
While application performance and power-efficiency are both important, application correctness is even more important. In other words, if the application is misbehaving, it is li...
Shimin Chen, Phillip B. Gibbons, Michael Kozuch, T...