Sciweavers

19866 search results - page 20 / 3974
» Computing all factorizations in ***
Sort
View
ECCC
2000
158views more  ECCC 2000»
14 years 9 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
64
Voted
CHI
2009
ACM
15 years 10 months ago
Wii all play: the console game as a computational meeting place
In this paper, we present results from a qualitative study of collocated group console gaming. We focus on motivations for, perceptions of, and practices surrounding the shared us...
Amy Voida, Saul Greenberg
66
Voted
DATE
2004
IEEE
116views Hardware» more  DATE 2004»
15 years 1 months ago
A Novel SAT All-Solutions Solver for Efficient Preimage Computation
In this paper, we present a novel all-solutions preimage SAT solver, SOLALL, with the following features: (1) a new success-driven learning algorithm employing smaller cut sets; (...
Bin Li, Michael S. Hsiao, Shuo Sheng
85
Voted
TC
2008
14 years 9 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
ISAAC
2003
Springer
103views Algorithms» more  ISAAC 2003»
15 years 2 months ago
On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts
Jae-Sook Cheong, Herman J. Haverkort, A. Frank van...