2969 search results - page 185 / 594 » A space efficient algorithm for group structure computation |
165
Voted
ICRA
2000
IEEE
15 years 7 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
137
click to vote
DAC
2002
ACM
16 years 4 months ago
2002
ACM
In this paper, we present a compiler strategy to optimize data accesses in regular array-intensive applications running on embedded multiprocessor environments. Specifically, we p...
125
Voted
DCC
2009
IEEE
16 years 4 months ago
2009
IEEE
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
222
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-or...
117
click to vote
RT
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...