Sciweavers

973 search results - page 97 / 195
» New Bounds on Crossing Numbers
Sort
View
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 6 days ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
SI3D
2009
ACM
15 years 6 months ago
A novel page-based data structure for interactive walkthroughs
Given a data layout of a large walkthrough scene, we present a novel and simple spatial hierarchy on the disk-pages of the layout that has notable advantages over a conventional s...
Behzad Sajadi, Yan Huang, Pablo Diaz-Gutierrez, Su...
QEST
2006
IEEE
15 years 6 months ago
Modeling Fiber Delay Loops in an All Optical Switch
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
Ana Busic, Mouad Ben Mamoun, Jean-Michel Fourneau
COLT
2001
Springer
15 years 4 months ago
Tracking a Small Set of Experts by Mixing Past Posteriors
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
Olivier Bousquet, Manfred K. Warmuth
VR
1999
IEEE
151views Virtual Reality» more  VR 1999»
15 years 4 months ago
A Framework for Fast and Accurate Collision Detection for Haptic Interaction
We present a framework for fast and accurate collision detection for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, ...
Arthur D. Gregory, Ming C. Lin, Stefan Gottschalk,...