2498 search results - page 268 / 500 » Data Structures with Unpredictable Timing |
178
click to vote
IJRR
2002
15 years 6 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
179
click to vote
SWAT
2000
Springer
15 years 10 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
192
click to vote
MSO
2003
15 years 8 months ago
2003
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
178
click to vote
VRML
2000
ACM
15 years 11 months ago
2000
ACM
When distributing 3D contents real-time over a network with a narrow bandwidth such as a telephone line, methods for streaming and data compression can be considered indispensable...
231
click to vote
PVLDB
2010
15 years 5 months ago
2010
Non-technical users are increasingly adding structures to their data. This gives rise to the need for database design. However, traditional database design is deliberate and heavy...