76 search results - page 10 / 16 » Testing Polynomials over General Fields |
ICFHR
2010
13 years 2 months ago
2010
Abstract--Doodle-based graphical passwords represent a challenging scenario due to their high variability and the tendency to be graphically simple. Despite this, doodle-based auth...
ESA
2004
Springer
14 years 26 days ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm fo...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Recently, models based on conditional random fields (CRF) have produced promising results on labeling sequential data in several scientific fields. However, in the vision task of c...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract—This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of quadrature amplitude modulation (QAM) and pulse amplitude modulatio...