Sciweavers

8699 search results - page 45 / 1740
» Elements of the Theory of Computation
Sort
View
PVM
2010
Springer
13 years 7 months ago
Massively Parallel Finite Element Programming
Abstract. Today’s large finite element simulations require parallel algorithms to scale on clusters with thousands or tens of thousands of processor cores. We present data struc...
Timo Heister, Martin Kronbichler, Wolfgang Bangert...
ENTCS
2006
110views more  ENTCS 2006»
13 years 8 months ago
First Steps in Synthetic Computability Theory
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
Andrej Bauer
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 9 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
NIME
2005
Springer
215views Music» more  NIME 2005»
14 years 2 months ago
GoingPublik: Using Realtime Global Score Synthesis
This paper takes the reader through various elements of the GoingPublik sound artwork for distributive ensemble and introduces the Realtime Score Synthesis tool (RSS) used as a co...
Arthur Clay, Thomas M. Frey, Jürg Gutknecht
BC
2005
122views more  BC 2005»
13 years 8 months ago
On partial contraction analysis for coupled nonlinear oscillators
We describe a simple but general method to analyze networks of coupled identical nonlinear oscillators, and study applications to fast synchronization, locomotion, and schooling. ...
Wei Wang 0008, Jean-Jacques E. Slotine