Sciweavers

3898 search results - page 194 / 780
» On the Bit Extraction Problem
Sort
View
TIT
2010
110views Education» more  TIT 2010»
14 years 9 months ago
Error rates of the maximum-likelihood detector for arbitrary constellations: convex/concave behavior and applications
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN ch...
Sergey Loyka, Victoria Kostina, François Ga...
DAC
1996
ACM
15 years 7 months ago
Stochastic Sequential Machine Synthesis Targeting Constrained Sequence Generation
- The problem of stochastic sequential machines (SSM) synthesis is addressed and its relationship with the constrained sequence generation problem which arises during power estimat...
Diana Marculescu, Radu Marculescu, Massoud Pedram
ICONIP
2007
15 years 4 months ago
Practical Recurrent Learning (PRL) in the Discrete Time Domain
One of the authors has proposed a simple learning algorithm for recurrent neural networks, which requires computational cost and memory capacity in practical order O(n2 )[1]. The a...
Mohamad Faizal Bin Samsudin, Takeshi Hirose, Katsu...
PUK
2000
15 years 4 months ago
4SP: A four stage incremental planning approach
GraphPlan-like and SATPLAN-like planners have shown to outperform classical planners for most of the classical planning domains. However, these two propositional approaches do not ...
Eva Onaindia, Laura Sebastia, Eliseo Marzal
ASIACRYPT
2007
Springer
15 years 9 months ago
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
Ueli M. Maurer, Dominik Raub