Sciweavers

361 search results - page 24 / 73
» Automatic Generation of Some Results in Finite Algebra
Sort
View
DM
2006
128views more  DM 2006»
13 years 8 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
ASYNC
2004
IEEE
107views Hardware» more  ASYNC 2004»
14 years 7 days ago
A Fast and Energy-Efficient Stack
We present some novel hardware implementations of a stack. All designs are clockless, fast, and energy efficient, while occupying modest area. We implemented a 42-place stack chip...
Jo C. Ebergen, Daniel Finchelstein, Russell Kao, J...
SMA
2009
ACM
157views Solid Modeling» more  SMA 2009»
14 years 3 months ago
Constraint-based model synthesis
We present a method for procedurally modeling general complex 3D shapes. Our approach is targeted towards applications in digital entertainment and gaming and can automatically ge...
Paul Merrell, Dinesh Manocha
COGSCI
2004
92views more  COGSCI 2004»
13 years 8 months ago
Varieties of crossing dependencies: structure dependence and mild context sensitivity
Four different kinds of grammars that can define crossing dependencies in human language are compared here: (i) context sensitive rewrite grammars with rules that depend on contex...
Edward P. Stabler Jr.
ECCC
2008
168views more  ECCC 2008»
13 years 8 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson