Sciweavers

1209 search results - page 59 / 242
» Approximation by pseudo-linear operators
Sort
View
RSCTC
2004
Springer
116views Fuzzy Logic» more  RSCTC 2004»
15 years 9 months ago
Constrained Sums of Information Systems
We study properties of infomorphisms between information systems. In particular, we interpret infomorphisms between information systems in terms of sums with constraints (constrain...
Andrzej Skowron, Jaroslaw Stepaniuk
ARITH
1999
IEEE
15 years 8 months ago
Complex Logarithmic Number System Arithmetic Using High-Radix Redundant CORDIC Algorithms
This paper describes the application of high radix redundant CORDIC algorithms to complex logarithmic number system arithmetic. It shows that a CLNS addition can be performed with...
David Lewis
MOR
2002
72views more  MOR 2002»
15 years 3 months ago
An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...
Jie Sun, Kim-Chuan Toh, Gongyun Zhao
MOC
1998
72views more  MOC 1998»
15 years 3 months ago
Interpolation correction for collocation solutions of Fredholm integro-differential equations
In this paper we discuss the collocation method for a large class of Fredholm linear integro-differential equations. It will be shown that, when a certain higher order interpolati...
Qiya Hu
PKC
2010
Springer
199views Cryptology» more  PKC 2010»
15 years 2 months ago
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
Steven D. Galbraith, Raminder S. Ruprai