Sciweavers

12438 search results - page 73 / 2488
» The Magic of a Number System
Sort
View
EUROCRYPT
2000
Springer
13 years 11 months ago
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
Nicolas Courtois, Alexander Klimov, Jacques Patari...
NAACL
2007
13 years 9 months ago
Analysis and System Combination of Phrase- and N-Gram-Based Statistical Machine Translation Systems
In the framework of the Tc-Star project, we analyze and propose a combination of two Statistical Machine Translation systems: a phrase-based and an N-gram-based one. The exhaustiv...
Marta R. Costa-Jussà, Josep Maria Crego, Da...
CC
2005
Springer
103views System Software» more  CC 2005»
13 years 8 months ago
Valiant's model and the cost of computing integers
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...
Pascal Koiran
JSAC
2008
106views more  JSAC 2008»
13 years 8 months ago
A Low-Complexity Detector for Large MIMO Systems and Multicarrier CDMA Systems
We consider large MIMO systems, where by `large' we mean number of transmit and receive antennas of the order of tens to hundreds. Such large MIMO systems will be of immense i...
K. Vishnu Vardhan, Saif K. Mohammed, Ananthanaraya...
CMA
2010
68views more  CMA 2010»
13 years 5 months ago
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
It is shown that the Clar number can be arbitrarily larger than the cardinality of a maximal alternating set. In particular, a maximal alternating set of a hexagonal system need n...
Sandi Klavzar, Khaled Salem, Andrej Taranenko