1333 search results - page 58 / 267 » Not a Number of Floating Point Problems |
107
Voted
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
207
Voted
CAD
2011
Springer
14 years 10 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
116
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
146
click to vote
ANTS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
121
click to vote
ISCAS
2006
IEEE
15 years 9 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...