Sciweavers

13621 search results - page 115 / 2725
» Computability and Complexity in Self-assembly
Sort
View
EGH
2003
Springer
14 years 3 months ago
CULLIDE: interactive collision detection between complex models in large environments using graphics hardware
We present a novel approach for fast collision detection between multiple deformable and breakable objects in a large environment using graphics hardware. Our algorithm takes into...
Naga K. Govindaraju, Stephane Redon, Ming C. Lin, ...
FOCS
2006
IEEE
14 years 4 months ago
Input-Indistinguishable Computation
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
Silvio Micali, Rafael Pass, Alon Rosen

Lecture Notes
357views
15 years 9 months ago
Computational Mechanism Design
Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Ph.D. dissertation, Univesity of Pennsylvania, May, 2001. The focus of this chapter is on the Gen...
David Parkes
JC
2006
139views more  JC 2006»
13 years 10 months ago
The basic feasible functionals in computable analysis
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
Branimir Lambov
WABI
2001
Springer
124views Bioinformatics» more  WABI 2001»
14 years 2 months ago
Computing Linking Numbers of a Filtration
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
Herbert Edelsbrunner, Afra Zomorodian