806 search results - page 123 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
CG
2006
Springer
15 years 1 months ago
2006
Springer
We propose an acceleration scheme for real-time many-body dynamic collision detection. We kinetize the sweep and prune method for many-body collision pruning, extending its applic...
123
click to vote
DEXAW
2002
IEEE
15 years 6 months ago
2002
IEEE
One characteristic of the next generation wireless mobile environments is a high level of interoperability between mobile applications and services. This imposes significant dema...
120
click to vote
IDEAS
2006
IEEE
15 years 7 months ago
2006
IEEE
This paper proposes CADRE (Collaborative Allocation and Deallocation of Replicas with Efficiency), a dynamic replication scheme for improving the typically low data availability ...
122
click to vote
WADS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
114
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract-Unstructured text represents a large fraction of the world's data. It often contain snippets of structured information within them (e.g., people's names and zip ...