Sciweavers

11565 search results - page 1880 / 2313
» Computing Minimal Mappings
Sort
View
PG
1999
IEEE
15 years 12 months ago
Automatic Creation of Object Hierarchies for Radiosity Clustering
Using object clusters for hierarchical radiosity greatly improves the efficiency and thus usability of radiosity computations. By eliminating the quadratic starting phase very lar...
Gordon Müller, Stephan Schäfer, Dieter W...
RECOMB
1997
Springer
15 years 12 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
SIGGRAPH
1994
ACM
15 years 11 months 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
SIGGRAPH
1992
ACM
15 years 11 months ago
Generative modeling: a symbolic system for geometric modeling
This paper discusses a new, symbolic approach to geometric modeling called generative modeling. The approach allows specification, rendering, and analysis of a wide variety of sha...
John M. Snyder, James T. Kajiya
CLUSTER
2004
IEEE
15 years 11 months ago
A comparison of local and gang scheduling on a Beowulf cluster
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
Peter E. Strazdins, John Uhlmann
« Prev « First page 1880 / 2313 Last » Next »