2920 search results - page 62 / 584 » Finite information logic |
159
click to vote
CAI
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Imaging is a class of non-Bayesian methods for the revision of probability density functions originally proposed as a semantics for conditional logic. Two of these revisi...
188
click to vote
GCC
2007
Springer
15 years 8 months ago
2007
Springer
In recent years, the rapid growth of m-commerce is being driven by various emerging mobile applications and services. Among them, mobile information service is considered to be on...
193
click to vote
ISDA
2006
IEEE
16 years 9 days ago
2006
IEEE
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
173
click to vote
FFA
2008
15 years 6 months ago
2008
Abstract. The subset sum problem over finite fields is a well known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study th...
261
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...