Sciweavers

8824 search results - page 75 / 1765
» On the Complexity of Real Functions
Sort
View
CSL
2005
Springer
15 years 5 months ago
Complexity and Intensionality in a Type-1 Framework for Computable Analysis
Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to floating point arithmetic imp...
Branimir Lambov
FDL
2008
IEEE
15 years 1 months ago
UML Profile for Modeling Product Observation
Nowadays interactive electronics products offer a huge functionality to prospective customers, but often it is too huge and complex to be grasped and used successfully. In this ca...
Mathias Funk, Piet van der Putten, Henk Corporaal
SIAMJO
2000
101views more  SIAMJO 2000»
14 years 11 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
IDA
1997
Springer
15 years 4 months ago
How to Find Big-Oh in Your Data Set (and How Not to)
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
Catherine C. McGeoch, Doina Precup, Paul R. Cohen
TIT
2010
107views Education» more  TIT 2010»
14 years 6 months ago
Rate distortion and denoising of individual data using Kolmogorov complexity
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
Nikolai K. Vereshchagin, Paul M. B. Vitányi