Sciweavers

36781 search results - page 95 / 7357
» Parameterizing by the Number of Numbers
Sort
View
CPAIOR
2010
Springer
14 years 3 months ago
Upper Bounds on the Number of Solutions of Binary Integer Programs
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
LSSC
2001
Springer
14 years 2 months ago
Solving Systems of Linear Algebraic Equations Using Quasirandom Numbers
In this paper we analyze a quasi-Monte Carlo method for solving systems of linear algebraic equations. It is well known that the convergence of Monte Carlo methods for numerical in...
Aneta Karaivanova, Rayna Georgieva
ALT
1994
Springer
14 years 2 months ago
Program Synthesis in the Presence of Infinite Number of Inaccuracies
Most studies modeling inaccurate data in Gold style learning consider cases in which the number of inaccuracies is finite. The present paper argues that this approach is not reaso...
Sanjay Jain
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
14 years 2 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
DSD
2004
IEEE
106views Hardware» more  DSD 2004»
14 years 2 months ago
Finite Precision Analysis of Support Vector Machine Classification in Logarithmic Number Systems
In this paper we present an analysis of the minimal hardware precision required to implement Support Vector Machine (SVM) classification within a Logarithmic Number System archite...
Faisal M. Khan, Mark G. Arnold, William M. Potteng...