Sciweavers

507 search results - page 29 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
TCS
2008
13 years 7 months ago
Real algebraic numbers and polynomial systems of small degree
We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...
Ioannis Z. Emiris, Elias P. Tsigaridas
TSP
2008
101views more  TSP 2008»
13 years 7 months ago
Subspace-Based Algorithm for Parameter Estimation of Polynomial Phase Signals
In this correspondence, parameter estimation of a polynomial phase signal (PPS) in additive white Gaussian noise is addressed. Assuming that the order of the PPS is at least 3, the...
Yuntao Wu, Hing Cheung So, Hongqing Liu
EUROPKI
2004
Springer
14 years 1 months ago
On the Use of Weber Polynomials in Elliptic Curve Cryptography
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
CVPR
2011
IEEE
13 years 3 months ago
FlowBoost - Appearance Learning from Sparsely Annotated Video
We propose a new learning method which exploits temporal consistency to successfully learn a complex appearance model from a sparsely labeled training video. Our approach consists...
Karim Ali, Francois Fleuret, David Hasler
JMLR
2012
11 years 10 months ago
Sparse Additive Machine
We develop a high dimensional nonparametric classification method named sparse additive machine (SAM), which can be viewed as a functional version of support vector machine (SVM)...
Tuo Zhao, Han Liu