Sciweavers

Share
DM
2000
76views more  DM 2000»
9 years 6 months ago
Applications of integer relation algorithms
Let a be a vector of real numbers. By an integer relation for a we mean a non-zero integer vector c such that caT = 0. We discuss the algorithms for nding such integer relations f...
Jonathan M. Borwein, Petr Lisonek
CORR
2004
Springer
107views Education» more  CORR 2004»
9 years 6 months ago
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
Pina Bergamo, Paolo D'Arco, Alfredo De Santis, Lju...
TFS
2008
112views more  TFS 2008»
9 years 6 months ago
Gradual Numbers and Their Application to Fuzzy Interval Analysis
Abstract-- We introduce a new way of looking at fuzzy intervals. Instead of considering them as fuzzy sets, we see them as crisp sets of entities we call gradual (real) numbers. Th...
Jérôme Fortin, Didier Dubois, H&eacut...
IM
2007
9 years 6 months ago
Real Number Labelings for Paths and Cycles
The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...
Jerrold R. Griggs, Xiaohua Teresa Jin
JC
2006
139views more  JC 2006»
9 years 7 months ago
The basic feasible functionals in computable analysis
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
Branimir Lambov
IGPL
2006
107views more  IGPL 2006»
9 years 7 months ago
Undecidability over Continuous Time
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
Jerzy Mycka, José Félix Costa
FUIN
2006
89views more  FUIN 2006»
9 years 7 months ago
Recursive Analysis Characterized as a Class of Real Recursive Functions
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive a...
Olivier Bournez, Emmanuel Hainry
ENTCS
2006
114views more  ENTCS 2006»
9 years 7 months ago
What is algebraic in process theory?
This is an extended version of an essay with the same title that I wrote for the workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond, held in Bertinoro, Ita...
Bas Luttik
CGF
2006
183views more  CGF 2006»
9 years 7 months ago
Cross Dissolve Without Cross Fade: Preserving Contrast, Color and Salience in Image Compositing
Linear interpolation is the standard image blending method used in image compositing. By averaging in the dynamic range, it reduces contrast and visibly degrades the quality of co...
Mark Grundland, Rahul Vohra, Gareth P. Williams, N...
ALGORITHMICA
2006
94views more  ALGORITHMICA 2006»
9 years 7 months ago
Efficient Algorithms for k Maximum Sums
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
Fredrik Bengtsson, Jingsen Chen
books