Sciweavers

2000 search results - page 285 / 400
» Program Transformation and Proof Transformation
Sort
View
ECCC
2010
91views more  ECCC 2010»
15 years 3 months ago
Limits on the rate of locally testable affine-invariant codes
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
Eli Ben-Sasson, Madhu Sudan
132
Voted
ENTCS
2007
121views more  ENTCS 2007»
15 years 3 months ago
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)
ly positive maps (extended abstract) Peter Selinger 1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories ...
Peter Selinger
123
Voted
TAPOS
1998
83views more  TAPOS 1998»
15 years 3 months ago
A Structured Text ADT for Object-Relational Databases
There is a growing need, both for use within corporate intranets and within the rapidly evolving World Wide Web, to develop tools that are able to retrieve relevant textual inform...
L. J. Brown, Mariano P. Consens, Ian J. Davis, Chr...
JCT
2010
82views more  JCT 2010»
15 years 2 months ago
Major index for 01-fillings of moon polyominoes
We propose a major index statistic on 01-fillings of moon polyominoes which, when specialized to certain shapes, reduces to the major index for permutations and set partitions. W...
William Y. C. Chen, Svetlana Poznanovic, Catherine...
137
Voted
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 7 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass