Sciweavers

4463 search results - page 312 / 893
» computing 2000
Sort
View
MOC
1998
147views more  MOC 1998»
15 years 6 months ago
On the Diophantine equation |axn - byn | = 1
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
Michael A. Bennett, Benjamin M. M. de Weger
MOC
1998
107views more  MOC 1998»
15 years 6 months ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche
MOC
1998
102views more  MOC 1998»
15 years 6 months ago
Classification of integral lattices with large class number
A detailed exposition of Kneser’s neighbour method for quadratic lattices over totally real number fields, and of the sub-procedures needed for its implementation, is given. Usi...
Rudolf Scharlau, Boris Hemkemeier
ICPR
2000
IEEE
16 years 7 months ago
Glasses Detection and Extraction by Deformable Contour
To achieve a face recognition system robust to the presence of glasses, we have developped a glasses detection and extraction algorithm. Detection is realized using edge informati...
Zhong Jing, Robert Mariani
EDBT
2000
ACM
15 years 11 months ago
Quality Assessment and Uncertainty Handling in Data Mining Process
The KDD process aims at the discovery and extraction of “useful” knowledge (such as interesting patterns, classification, rules etc) from large data repositories. A widely rec...
Maria Halkidi