Results 1  10
of
9,407
COMPACT HANKEL OPERATORS ON THE HARDY SPACE OF THE POLYDISK
"... ABSTRACT. We show that a big Hankel operator on the standard Hardy space of the polydisk Dn, n> 1, cannot be compact unless it is the zero operator. We also show that this result can be generalized to certain Hankel operators defined on HardySobolev spaces of the polydisk. 1. ..."
Abstract
 Add to MetaCart
ABSTRACT. We show that a big Hankel operator on the standard Hardy space of the polydisk Dn, n> 1, cannot be compact unless it is the zero operator. We also show that this result can be generalized to certain Hankel operators defined on HardySobolev spaces of the polydisk. 1.
SPECTRAL INVERSE PROBLEMS FOR COMPACT HANKEL OPERATORS
, 2012
"... Abstract. Given two arbitrary sequences (λj)j≥1 and (µj)j≥1 of real numbers satisfying λ1 > µ1 > λ2 > µ2 > ·· ·> λj > µj  → 0, we prove that there exists a unique sequence c = (cn)n∈Z +, real valued, such that the Hankel operators Γc and Γ˜c of symbols c = (cn)n≥0 and ..."
Abstract
 Add to MetaCart
generally, given two arbitrary sequences (ρj)j≥1 and (σj)j≥1 of positive numbers satisfying ρ1> σ1> ρ2> σ2> ·· ·> ρj> σj → 0, we describe the set of sequences c = (cn)n∈Z + of complex numbers such that the Hankel operators Γc and Γ˜c are compact on ℓ 2 (Z+) and have sequences (ρj)j≥1
Compact Hankel operators on generalized Bergman spaces of the polydisc
 Integral Equations Operator Theory
"... ar ..."
Trace Scheduling: A Technique for Global Microcode Compaction
 IEEE TRANSACTIONS ON COMPUTERS
, 1981
"... Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local compaction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of highlevel microcode languages int ..."
Abstract

Cited by 683 (5 self)
 Add to MetaCart
with a broad overview of the program. Important operations are given priority, no matter what their source block was. This is in sharp contrast with earlier methods, which compact one block at a time and then attempt iterative improvement. It is argued that those methods suffer from the lack
The Laplacian Pyramid as a Compact Image Code
, 1983
"... We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixeltopixel correlations a ..."
Abstract

Cited by 1388 (12 self)
 Add to MetaCart
We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixeltopixel correlations
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 558 (0 self)
 Add to MetaCart
space is not σfinite. p. 13: add after I.2.6.16: I.2.6.17. If X is a compact subset of C not containing 0, and k ∈ N, there is in general no bound on the norm of T −1 as T ranges over all operators with ‖T ‖ ≤ k and σ(T) ⊆ X. For example, let Sn ∈ L(l 2) be the truncated shift: Sn(α1, α2,...) = (0
Contiki  a Lightweight and Flexible Operating System for Tiny Networked Sensors
, 2004
"... of tiny networked devices that communicate untethered. For large scale networks it is important to be able to dynamically download code into the network. In this paper we present Contiki, a lightweight operating system with support for dynamic loading and replacement of individual programs and servi ..."
Abstract

Cited by 516 (45 self)
 Add to MetaCart
of tiny networked devices that communicate untethered. For large scale networks it is important to be able to dynamically download code into the network. In this paper we present Contiki, a lightweight operating system with support for dynamic loading and replacement of individual programs
NonCompact λHankel Operators.
, 2000
"... A #Hankel operator X is a bounded operator on Hilbert space satisfying the operator equation S # X XS = #X, where S is the (unilateral) forward shift and S # is its adjoint. We prove that there are noncompact #Hankel operators for # a complex number of modulus less than 2, by first exhibit ..."
Abstract
 Add to MetaCart
A #Hankel operator X is a bounded operator on Hilbert space satisfying the operator equation S # X XS = #X, where S is the (unilateral) forward shift and S # is its adjoint. We prove that there are noncompact #Hankel operators for # a complex number of modulus less than 2, by first
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important
Software pipelining: An effective scheduling technique for VLIW machines
, 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract

Cited by 581 (3 self)
 Add to MetaCart
pipelining is that optimal performance can be achieved with compact object code. This paper extends previous results of software pipelining in two ways: First, this paper shows that by using an improved algorithm, nearoptimal performance can be obtained without specialized hardware. Second, we propose a
Results 1  10
of
9,407