Sciweavers

193 search results - page 9 / 39
» Short Bases of Lattices over Number Fields
Sort
View
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 7 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...
EUROCRYPT
2006
Springer
13 years 11 months ago
The Function Field Sieve in the Medium Prime Case
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
Antoine Joux, Reynald Lercier
ACL
2008
13 years 8 months ago
Efficient, Feature-based, Conditional Random Field Parsing
Discriminative feature-based methods are widely used in natural language processing, but sentence parsing is still dominated by generative methods. While prior feature-based dynam...
Jenny Rose Finkel, Alex Kleeman, Christopher D. Ma...
ICDM
2008
IEEE
164views Data Mining» more  ICDM 2008»
14 years 1 months ago
Classifying High-Dimensional Text and Web Data Using Very Short Patterns
In this paper, we propose the "Democratic Classifier", a simple, democracy-inspired patternbased classification algorithm that uses very short patterns for classificatio...
Hassan H. Malik, John R. Kender
FOSSACS
2011
Springer
12 years 10 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman