2370 search results - page 235 / 474 » The Characterization of Data-Accumulating Algorithms |
107
click to vote
EUROPAR
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. When parallelizing loop nests for distributed memory parallel computers, we have to specify when the different computations are carried out (computation scheduling), wher...
117
click to vote
CSR
2010
Springer
15 years 7 months ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
108
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we present a shadow removal technique which effectively eliminates a human shadow cast from an unknown direction of light source. A multi-cue shadow descriptor is p...
144
click to vote
SGP
2004
15 years 6 months ago
2004
Subdivision-based representations are recognized as important tools for the generation of high-quality surfaces for Computer Graphics. In this paper we describe two parameterizati...
145
click to vote
AAAI
2008
15 years 6 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...