Sciweavers

11213 search results - page 2202 / 2243
» Low-contention data structures
Sort
View
VLDB
1997
ACM
97views Database» more  VLDB 1997»
14 years 26 days ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
APN
1992
Springer
14 years 25 days ago
Towards a Modular Analysis of Coloured Petri Nets
The use of different High-level Petri net formalisms has made it possible to create Petri net models of large systems. Even though the use of such models allows the modeller to cr...
Søren Christensen, Laure Petrucci
SIGGRAPH
1993
ACM
14 years 24 days ago
View interpolation for image synthesis
Image-space simplifications have been used to accelerate the calculation of computer graphic images since the dawn of visual simulation. Texture mapping has been used to provide a...
Shenchang Eric Chen, Lance Williams
SIGGRAPH
1994
ACM
14 years 24 days ago
Zippered polygon meshes from range images
Range imaging offers an inexpensive and accurate means for digitizing the shape of three-dimensional objects. Because most objects self occlude, no single range image suffices to ...
Greg Turk, Marc Levoy
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 24 days ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
« Prev « First page 2202 / 2243 Last » Next »