Sciweavers

1794 search results - page 45 / 359
» Visualizing Memory Graphs
Sort
View
VISUALIZATION
1998
IEEE
15 years 6 months ago
Fast and memory efficient polygonal simplification
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification ...
Peter Lindstrom, Greg Turk
EGPGV
2004
Springer
119views Visualization» more  EGPGV 2004»
15 years 7 months ago
Parallel Implicit Integration for Cloth Animations on Distributed Memory Architectures
We present a parallel cloth simulation engine designed for distributed memory parallel architectures, in particular clusters built of commodity components. We focus on efficient ...
Michael Keckeisen, Wolfgang Blochinger
149
Voted
VIS
2009
IEEE
215views Visualization» more  VIS 2009»
16 years 3 months ago
Iconizer: A Framework to Identify and Create Effective Representations for Visual Information Encoding
concept form search query vision confirm consensus refine search query graphics VIE-designer image objects image objects Visual Sign (VIE) run search query words images Iconizer:...
Supriya Garg, Tamara Berg, Klaus Mueller
AAAI
2006
15 years 3 months ago
Domain-Independent Structured Duplicate Detection
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Rong Zhou, Eric A. Hansen
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 2 months ago
The Parallel-Sequential Duality : Matrices and Graphs
Abstract. Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove t...
Serge Burckel