Results 1  10
of
789,183
On the Construction of Wavelets on a Bounded Interval
"... This paper presents a general approach to a multiresolution analysis and wavelet spaces on the interval [\Gamma1; 1]. Our method is based on the Chebyshev transform, corresponding shifts and the discrete cosine transform (DCT). For the wavelet analysis of given functions, efficient decomposition and ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
and reconstruction algorithms are proposed using fast DCTalgorithms. As examples for scaling functions and wavelets, polynomials and transformed splines are considered. 1 Introduction Recently, several constructions of wavelets on a bounded interval have been presented. Most of these approaches are based
Domination in Bounded Interval Tolerance Graphs
"... In this paper we present efficient algorithms to solve domination set problem for the class of bounded tolerance graphs. The class of bounded tolerance graphs includes interval graphs and permtation graph as subclasses. Our solution to domination set problem has improved bounds for time complexity t ..."
Abstract
 Add to MetaCart
In this paper we present efficient algorithms to solve domination set problem for the class of bounded tolerance graphs. The class of bounded tolerance graphs includes interval graphs and permtation graph as subclasses. Our solution to domination set problem has improved bounds for time complexity
Instant Ray Tracing: The Bounding Interval Hierarchy
 IN RENDERING TECHNIQUES 2006 – PROCEEDINGS OF THE 17TH EUROGRAPHICS SYMPOSIUM ON RENDERING
, 2006
"... We introduce a new ray tracing algorithm that exploits the best of previous methods: Similar to bounding volume hierarchies the memory of the acceleration data structure is linear in the number of objects to be ray traced and can be predicted prior to construction, while the traversal of the hiera ..."
Abstract

Cited by 61 (2 self)
 Add to MetaCart
We introduce a new ray tracing algorithm that exploits the best of previous methods: Similar to bounding volume hierarchies the memory of the acceleration data structure is linear in the number of objects to be ray traced and can be predicted prior to construction, while the traversal
Linearity Constraints as Bounded Intervals in Linear Logic Programming
"... Abstract We present a new system of resource management forlinear logic programming which ensures linearity constraints are satisfied solely by manipulating individual formula tags. In our system, tags are rational numbers, and a single bounded interval suffices to characterize all of theavailable ..."
Abstract
 Add to MetaCart
Abstract We present a new system of resource management forlinear logic programming which ensures linearity constraints are satisfied solely by manipulating individual formula tags. In our system, tags are rational numbers, and a single bounded interval suffices to characterize all of theavailable
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
Plans And ResourceBounded Practical Reasoning
 COMPUTATIONAL INTELLIGENCE, 4(4):349355, 1988
, 1988
"... An architecture for a rational agent must allow for meansend reasoning, for the weighing of competing alternatives, and for interactions between these two forms of reasoning. Such an architecture must also address the problem of resource boundedness. We sketch a solution of the first problem that p ..."
Abstract

Cited by 485 (19 self)
 Add to MetaCart
that points the way to a solution of the second. In particular, we present a highlevel specification of the practicalreasoning component of an architecture for a resourcebounded rational agent. In this architecture, a major role of the agent's plans is to constrain the amount of further practical
Asymptotic Confidence Intervals for Indirect Effects in Structural EQUATION MODELS
 IN SOCIOLOGICAL METHODOLOGY
, 1982
"... ..."
Ktheory for operator algebras
 Mathematical Sciences Research Institute Publications
, 1998
"... p. XII line5: since p. 12: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The RieszFischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract

Cited by 559 (0 self)
 Add to MetaCart
] is a bounded interval in R, in modern language the original statement of the theorem was that L 2 ([a, b]) is complete and abstractly isomorphic to l 2. According to [Jah03, p. 385], the name “Hilbert space ” was first used in 1908 by A. Schönflies, apparently to refer to what we today call l 2. Von
Results 1  10
of
789,183