Sciweavers

8 search results - page 1 / 2
» On Computing Solutions of Linear Diophantine Equations with ...
Sort
View
SYNASC
2008
IEEE
266views Algorithms» more  SYNASC 2008»
14 years 1 months ago
On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter
We present an algorithm for solving Diophantine equations which are linear in the variables, but non-linear in one parameter. This enables us to compute data dependences in more ge...
Armin Größlinger, Stefan Schuster
MOC
1998
147views more  MOC 1998»
13 years 7 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
ECCV
2006
Springer
14 years 9 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner
PRL
2011
13 years 2 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
IPL
2010
119views more  IPL 2010»
13 years 5 months ago
Note on Max Lin-2 above Average
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...
Robert Crowston, Gregory Gutin, Mark Jones