Sciweavers

349 search results - page 23 / 70
» Generating Lexical Analogies Using Dependency Relations
Sort
View
TAPSOFT
1995
Springer
13 years 11 months ago
Generic Techniques for Source-Level Debugging and Dynamic Program Slicing
Algebraic specifications have been used successfully as a formal basis for software development. This paper discusses how the origin and dynamic dependence relations implicitly de...
Frank Tip
CHES
1999
Springer
133views Cryptology» more  CHES 1999»
14 years 1 days ago
Random Number Generators Founded on Signal and Information Theory
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
David Paul Maher, Robert J. Rance
ACL
2012
11 years 10 months ago
A Comparison of Chinese Parsers for Stanford Dependencies
Stanford dependencies are widely used in natural language processing as a semanticallyoriented representation, commonly generated either by (i) converting the output of a constitu...
Wanxiang Che, Valentin I. Spitkovsky, Ting Liu
ILP
2005
Springer
14 years 1 months ago
Online Closure-Based Learning of Relational Theories
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...
Frédéric Koriche
UAI
2008
13 years 9 months ago
Latent Topic Models for Hypertext
Latent topic models have been successfully applied as an unsupervised topic discovery technique in large document collections. With the proliferation of hypertext document collect...
Amit Gruber, Michal Rosen-Zvi, Yair Weiss