Sciweavers

882 search results - page 85 / 177
» On self-embeddings of computable linear orderings
Sort
View
SIGGRAPH
2000
ACM
15 years 10 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
SC
1995
ACM
15 years 10 months ago
A Novel Approach Towards Automatic Data Distribution
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
Jordi Garcia, Eduard Ayguadé, Jesús ...
CONCUR
2008
Springer
15 years 8 months ago
A Scalable and Oblivious Atomicity Assertion
Abstract. This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register imp...
Rachid Guerraoui, Marko Vukolic
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 6 months ago
Asymptotically Stable Walking of a Five-Link Underactuated 3D Bipedal Robot
This paper presents three feedback controllers that achieve an asymptotically stable, periodic, and fast walking gait for a 3D bipedal robot consisting of a torso, revolute knees, ...
Christine Chevallereau, Jessy W. Grizzle, Ching-Lo...
TOG
2002
165views more  TOG 2002»
15 years 6 months ago
CHARMS: a simple framework for adaptive simulation
Finite element solvers are a basic component of simulation applications; they are common in computer graphics, engineering, and medical simulations. Although adaptive solvers can ...
Eitan Grinspun, Petr Krysl, Peter Schröder