Browsing by Title

Now showing items 3538-3557 of 4789

  • Relations of the spaces Ap (Ω) and C p (∂Ω) 

    Georgakopoulos, N; Mastrantonis, V; Nestoridis, V
    Let Ω be a Jordan domain in C, J an open arc of ∂Ω and φ : D → Ω a Riemann map from the open unit disk D onto Ω. Under certain assumptions on φ we prove that if a holomorphic function f ∈ H(Ω) extends continuously on Ω ∪ ...

  • Relative Affine Structure: Canonical Model for 3D from 2D Geometry and Applications 

    Unknown author (1994-06-01)
    We propose an affine framework for perspective views, captured by a single extremely simple equation based on a viewer-centered invariant we call "relative affine structure". Via a number of corollaries of our main ...

  • Relative Contributions of Internal and External Features to Face Recognition 

    Unknown author (2003-03-01)
    The central challenge in face recognition lies in understanding the role different facial features play in our judgments of identity. Notable in this regard are the relative contributions of the internal (eyes, nose and ...

  • Relative Orientation 

    Unknown author (1987-09-01)
    Before corresponding points in images taken with two cameras can be used to recover distances to objects in a scene, one has to determine the position and orientation of one camera relative to the other. This is the ...

  • Relativistic magnetised perturbations: Magnetic pressure versus magnetic tension 

    Tseneklidou, D; Tsagas, CG; Barrow, John David (IoPClassical and Quantum Gravity, 2018-05-16)
    We study the linear evolution of magnetised cosmological perturbations in the post-recombination epoch. Using full general relativity and adopting the ideal magnetohydrodynamic approximation, we refine and extend the ...

  • Relativistic Quantum Tasks 

    Adlam, Emily Christine
    Quantum mechanics, which describes the behaviour of matter and energy on very small scales, is one of the most successful theories in the history of science. Einstein's theory of special relativity, which describes the ...

  • A Relaxation Approach to Splitting in an Automatic Theorem Prover 

    Unknown author (1974-01-01)
    The splitting of a problem into subproblems often involves the same variable appearing in more than one of the subproblems. This makes these subproblems dependent upon one another since a solution to one may not qualify ...

  • Relaxing the Brightness Constancy Assumption in Computing Optical Flow 

    Unknown author (1987-06-01)
    Optical flow is the apparent (or perceived) motion of image brightness patterns arising from relative motion of objects and observer. Estimation of the optical flow requires the application of two kinds of constraint: ...

  • Reliability-Aware Optimization of Approximate Computational Kernels with Rely 

    Unknown author (2014-01-09)
    Emerging high-performance architectures are anticipated to contain unreliable components (e.g., ALUs) that offer low power consumption at the expense of soft errors. Some applications (such as multimedia processing, machine ...

  • Reliable Interconnection Networks for Parallel Computers 

    Unknown author (1991-10-01)
    This technical report describes a new protocol, the Unique Token Protocol, for reliable message communication. This protocol eliminates the need for end-to-end acknowledgments and minimizes the communication effort ...

  • Reliably Detecting Connectivity using Local Graph Traits 

    Unknown author (2010-09-09)
    Local distributed algorithms can only gather sufficient information to identify local graph traits, that is, properties that hold within the local neighborhood of each node. However, it is frequently the case that global ...

  • Remarks on Correlation Tracking 

    Unknown author (1967-03-01)
    The problem is to track the motion of part of a field of view. Let us assume that the scene is a two-dimensional picture in a plane perpendicular to the roll axis. (these simplifying assumptions, of course, are a main ...

  • Remarks on motives of abelian type 

    Vial, Charles (Tohoku Mathematical Journal, 2015-08-11)
    A motive over a field k is of abelian type if it belongs to the thick and rigid subcategory of Chow motives spanned by the motives of abelian varieties over k. This paper contains three sections of independent interest. ...

  • Remarks on Visual Display and Console Systems 

    Unknown author (1968-06-01)
    This serves as a preliminary draft of Deluxe Picture Maintenance System, June, 1963. It is Technical Memorandum No. 1.

  • Remote Oblivious Storage: Making Oblivious RAM Practical 

    Unknown author (2011-03-30)
    Remote storage of data has become an increasingly attractive and advantageous option, especially due to cloud systems. While encryption protects the data, it does not hide the access pattern to the data. A natural solution ...

  • Remote Store Programming: Mechanisms and Performance 

    Unknown author (2009-05-05)
    This paper presents remote store programming (RSP). This paradigm combines usability and efficiency through the exploitation of a simple hardware mechanism, the remote store, which can easily be added to existing ...

  • Removing Shadows in a Scene 

    Unknown author (1970-08-01)
    This paper describes a LISP function, ERASER, to be used in the process of recognizing objects by a computer. It is a pre-processor to a program called SEE which finds whole bodies in a scene. A short description of SEE ...

  • Repairing Learned Knowledge Using Experience 

    Unknown author (1990-05-01)
    Explanation-based learning occurs when something useful is retained from an explanation, usually an account of how some particular problem can be solved given a sound theory. Many real-world explanations are not based ...

  • Report on the 2015 NSF Workshop on Unified Annotation Tooling 

    Unknown author (2016-11-08)
    On March 30 & 31, 2015, an international group of twenty-three researchers with expertise in linguistic annotation convened in Sunny Isles Beach, Florida to discuss problems with and potential solutions for the state of ...

  • Report on the Probabilistic Language Scheme 

    Unknown author (2007-10-22)
    Reasoning with probabilistic models is a widespread andsuccessful technique in areas ranging from computer vision, to naturallanguage processing, to bioinformatics. Currently, these reasoningsystems are either coded from ...