6978 search results - page 391 / 1396 » On Proofs in System P |
182
click to vote
TLCA
2005
Springer
16 years 10 days ago
2005
Springer
There is growing public concern about personal data collected by both private and public sectors. People have very little control over what kinds of data are stored and how such da...
173
click to vote
CCS
2008
ACM
15 years 9 months ago
2008
ACM
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
149
click to vote
SIAMCO
2002
15 years 6 months ago
2002
We consider linear systems with m inputs, p outputs and McMillan degree n, such that n = mp. If both m and p are even, we show that there is a non-empty open (in the usual topology...
186
click to vote
APIN
1999
15 years 6 months ago
1999
The Connectionist Inductive Learning and Logic Programming System, C-IL 2 P, integrates the symbolic and connectionist paradigms of Artificial Intelligence through neural networks...
192
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....