1920 search results - page 231 / 384 » The Range Constraint: Algorithms and Implementation |
152
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
162
click to vote
HIPC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
119
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
128
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
An analysis is presented of the primary factors influencing the performance of a parallel implementation of the UCLA atmospheric general circulation model (AGCM) on distributedme...
134
click to vote
RT
1995
Springer
15 years 7 months ago
1995
Springer
We describe a new framework for efficiently computing and storing global illumination effects for complex, animated environments. The new framework allows the rapid generation of ...