10051 search results - page 25 / 2011 » A Dynamic Separator Algorithm |
76
Voted
VMV
2008
15 years 1 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
95
Voted
CSL
2004
Springer
15 years 4 months ago
2004
Springer
It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same pr...
124
click to vote
PLDI
2012
ACM
13 years 2 months ago
2012
ACM
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
COMPSAC
2006
IEEE
15 years 6 months ago
2006
IEEE
Modern mobile computing paradigms have set new challenges for the development of distributed mobile applications and services. Because of the variability which characterizes the c...