Sciweavers

152 search results - page 2 / 31
» Equations over Sets of Natural Numbers with Addition Only
Sort
View
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
15 years 4 months ago
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
Ronald Cramer, Serge Fehr, Martijn Stam
IPL
2008
95views more  IPL 2008»
14 years 11 months ago
Approximating maximum satisfiable subsystems of linear equations of bounded width
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
Zeev Nutov, Daniel Reichman
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
15 years 11 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
ASAP
2002
IEEE
170views Hardware» more  ASAP 2002»
15 years 4 months ago
Reviewing 4-to-2 Adders for Multi-Operand Addition
Recently there has been quite a number of papers discussing the use of redundant 4-to-2 adders for the accumulation of partial products in multipliers, claiming one type to be sup...
Peter Kornerup
JCT
2007
99views more  JCT 2007»
14 years 11 months ago
Independence for partition regular equations
A matrix A is said to be partition regular (PR) over a subset S of the positive integers if whenever S is finitely coloured, there exists a vector x, with all elements in the sam...
Imre Leader, Paul A. Russell