7272 search results - page 1158 / 1455 » On the Performance of Selection Relaying |
207
click to vote
DAWAK
1999
Springer
15 years 11 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
214
click to vote
DAWAK
1999
Springer
15 years 11 months ago
1999
Springer
One of the most challenging problems in data manipulation in the future is to be able to e ciently handle very large databases but also multiple induced properties or generalizatio...
182
click to vote
IV
1999
IEEE
15 years 11 months ago
1999
IEEE
The aim of occlusion culling is to cull away a significant amount of invisible primitives at different viewpoints. We present two algorithms to improve occlusion culling for a hig...
212
click to vote
ESOP
1999
Springer
15 years 11 months ago
1999
Springer
Safety of interoperation of program fragments written in different safe languages may fail when the languages have different systems of computational effects: an exception raised b...
171
click to vote
ISHPC
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Dynamic program optimization is the only recourse for optimizing compilers when machine and program parameters necessary for applying an optimization technique are unknow...