Sciweavers

2693 search results - page 158 / 539
» On Computing Complex Navigation Functions
Sort
View
CG
2011
Springer
14 years 10 months ago
IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions
We propose a compact, dimension-independent data structure for manifold, non-manifold and non-regular simplicial complexes, that we call the Generalized Indexed Data structure wit...
David Canino, Leila De Floriani, Kenneth Weiss
ECCC
2000
158views more  ECCC 2000»
15 years 6 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
SIGCSE
2010
ACM
164views Education» more  SIGCSE 2010»
16 years 1 months ago
Scalable game design and the development of a checklist for getting computational thinking into public schools
Game design appears to be a promising approach to interest K-12 students in Computer Science. Unfortunately, balancing motivational and educational concerns is truly challenging. ...
Alexander Repenning, David C. Webb, Andri Ioannido...
FOCS
2003
IEEE
15 years 11 months ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
ANSS
2007
IEEE
16 years 26 days ago
Evaluating the Design of Biological Cells Using a Computer Workbench
For embedded systems as well as for biological cell systems, design is a feature that defines their identity. The assembly of different components in designs of both systems can ...
Tessa E. Pronk, Simon Polstra, Andy D. Pimentel, T...