Sciweavers

619 search results - page 5 / 124
» Generic Extensions and Generic Polynomials
Sort
View
ACL
2010
13 years 5 months ago
Identifying Generic Noun Phrases
This paper presents a supervised approach for identifying generic noun phrases in context. Generic statements express rulelike knowledge about kinds or events. Therefore, their id...
Nils Reiter, Anette Frank
ICFP
2006
ACM
14 years 7 months ago
Context-parametric polykinded types
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
Pablo Nogueira
CHES
2008
Springer
132views Cryptology» more  CHES 2008»
13 years 9 months ago
Light-Weight Instruction Set Extensions for Bit-Sliced Cryptography
Bit-slicing is a non-conventional implementation technique for cryptographic software where an n-bit processor is considered as a collection of n 1-bit execution units operating in...
Philipp Grabher, Johann Großschädl, Dan...
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 7 months ago
Explicit factors of some iterated resultants and discriminants
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials...
Laurent Busé, Bernard Mourrain
ISSAC
1997
Springer
102views Mathematics» more  ISSAC 1997»
13 years 11 months ago
A Numerical Absolute Primality Test for Bivariate Polynomials
We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of...
André Galligo, Stephen M. Watt