Sciweavers

1018 search results - page 160 / 204
» Generative unbinding of names
Sort
View
CN
1999
143views more  CN 1999»
13 years 8 months ago
Embedding Knowledge in Web Documents
The paper argues for the use of general and intuitive knowledge representation languages (and simpler notational variants, e.g. subsets of natural languages) for indexing the cont...
Philippe Martin, Peter W. Eklund
JOC
2002
99views more  JOC 2002»
13 years 8 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski
JOLLI
2002
74views more  JOLLI 2002»
13 years 8 months ago
Referent Systems and Relational Grammar
Abstract. Relational Grammar (RG) was introduced in the 70's as a theory of grammatical relations and relation change, for example, passivization, dative shift, and raising. F...
Marcus Kracht
MVA
2002
254views Computer Vision» more  MVA 2002»
13 years 8 months ago
Retinal Blood Vessel Extraction by Using Multi-resolution Matched Filtering and Directional Region Growing Segmentation
Anew method to extract retinal blood vessels from a colour fundus image is described. Digital colour h d u s images are contrast enhanced in order to obtain sharp edges. The green...
Mitsutoshi Himaga, David Usher, James F. Boyce
RSA
2002
99views more  RSA 2002»
13 years 8 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott