Sciweavers

973 search results - page 50 / 195
» New Bounds on Crossing Numbers
Sort
View
BIRTHDAY
2003
Springer
15 years 5 months ago
Bounded Fairness
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
Nachum Dershowitz, D. N. Jayasimha, Seungjoon Park
SIGMOD
2006
ACM
107views Database» more  SIGMOD 2006»
15 years 12 months ago
Relaxed space bounding for moving objects: a case for the buddy tree
Rapid advancements in positioning systems and wireless communications enable accurate tracking of continuously moving objects. This development poses new challenges to database te...
Shuqiao Guo, Zhiyong Huang, H. V. Jagadish, Beng C...
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
15 years 5 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
CORR
2007
Springer
150views Education» more  CORR 2007»
14 years 11 months ago
Composable Security in the Bounded-Quantum-Storage Model
We give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damg...
Stephanie Wehner, Jürg Wullschleger
SAT
2009
Springer
113views Hardware» more  SAT 2009»
15 years 6 months ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...