Sciweavers

785 search results - page 123 / 157
» Binary Join Trees
Sort
View
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 4 days 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
ICPR
2006
IEEE
15 years 10 months ago
Efficient, Simultaneous Detection of Multiple Object Classes
At present, the object categorisation literature is still dominated by the use of individual class detectors. Detecting multiple classes then implies the subsequent application of...
Esther Koller-Meier, Luc J. Van Gool, Philipp Zehn...
PERCOM
2007
ACM
15 years 9 months ago
Energy-Aware Tag Anti-Collision Protocols for RFID Systems
Energy consumption of mobile readers is becoming an important issue as applications of RFID systems pervade different aspects of our lives. Surprisingly, however, these systems ar...
Vinod Namboodiri, Lixin Gao
ATAL
2009
Springer
15 years 4 months ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham
PG
2007
IEEE
15 years 4 months ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang