Sciweavers

ESA
2006
Springer
70views Algorithms» more  ESA 2006»
13 years 8 months ago
Kinetic Algorithms Via Self-adjusting Computation
Abstract. Define a static algorithm as an algorithm that computes some combinatorial property of its input consisting of static, i.e., non-moving, objects. In this paper, we descri...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
13 years 8 months ago
Kinetic Collision Detection for Convex Fat Objects
We design compact and responsive kinetic data structures for detecting collisions between n convex fat objects in 3-dimensional space that can have arbitrary sizes. Our main result...
Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon,...
ESA
2006
Springer
92views Algorithms» more  ESA 2006»
13 years 8 months ago
Out-of-Order Event Processing in Kinetic Data Structures
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...
ESA
2006
Springer
126views Algorithms» more  ESA 2006»
13 years 8 months ago
Cooperative TSP
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...
Amitai Armon, Adi Avidor, Oded Schwartz
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
13 years 8 months ago
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables
The sequential importance sampling (SIS) algorithm has gained considerable popularity for its empirical success. One of its noted applications is to the binary contingency tables p...
Ivona Bezáková, Alistair Sinclair, D...