Results 1  10
of
91
Optimal tests for homogeneity of covariance, scale, and shape
 J. Multivariate Anal
, 2008
"... The assumption of homogeneity of covariance matrices is the fundamental prerequisite of a number of classical procedures in multivariate analysis. Despite its importance and long history, however, this problem so far has not been completely settled beyond the traditional and highly unrealistic cont ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
specified mtuple of radial densities f = (f1,..., fm). Combined with an estimation of the m densities f1,..., fm, these procedures can be used to construct adaptive tests for the problem. Adaptive tests however typically require very large samples, and pseudoGaussian tests—namely, tests that are locally
Keyword search in spatial databases: towards searching by document.
 In ICDE,
, 2009
"... AbstractThis work addresses a novel spatial keyword query called the mclosest keywords (mCK) query. Given a database of spatial objects, each tuple is associated with some descriptive information represented in the form of keywords. The mCK query aims to find the spatially closest tuples which ma ..."
Abstract

Cited by 44 (2 self)
 Add to MetaCart
AbstractThis work addresses a novel spatial keyword query called the mclosest keywords (mCK) query. Given a database of spatial objects, each tuple is associated with some descriptive information represented in the form of keywords. The mCK query aims to find the spatially closest tuples which
The Recovery of a Schema Mapping: Bringing Exchanged Data Back
 IN PROCEEDINGS OF THE 28TH ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS
, 2008
"... A schema mapping is a specification that describes how data from a source schema is to be mapped to a target schema. Once the data has been transferred from the source to the target, a natural question is whether one can undo the process and recover the initial data, or at least part of it. In fact, ..."
Abstract

Cited by 39 (13 self)
 Add to MetaCart
, it would be desirable to find a reverse schema mapping from target to source that specifies how to bring the exchanged data back. In this paper, we introduce the notion of a recovery of a schema mapping: it is a reverse mapping M ′ for a mapping M that recovers sound data with respect to M. We further
An Implementation for Nested Relational Databases
 Proc. VLDB Conf
, 1988
"... We propose an architecture for implementing nested re In this paper we propose an implementation, ANDA’ lational databases. In particular, we discuss the storage for the Nested Relational Data Model(NRJ3M). In parstructures, their organization and an access language titular, we diicuaa the storage ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
structures, their orgafor specifying access plans. nization, and an access language for specifying access The featurw of our implementation are: plans. The motivation for our design comes from these observations: A notation for hierarchical tuple identification. One valuedriven indexing structure (VALTREE
XDU, Fall 2011 Lecture Notes 4.6 Behavioral Models of Codes and Factor Graph Representation
, 2011
"... It is well known that turbo codes, LDPC codes, and repeataccumulate (RA) codes can approach Shannon limit very closely. A common feature of these capacityapproaching coding schemes is that they all may be understood as codes defined on graphs. In this section, we will introduce the subject of code ..."
Abstract
 Add to MetaCart
variable Xi takes values i ix ∈X in a symbol alphabet Xi. In coding, Xi is often a vector space over a finite field, e.g., mqF, and xi are the corresponding mtuples. A symbol configuration space X is a Cartesian product i i I∈
A classical PT theorem
, 2007
"... This note states and proves a theorem that appears to be a classical counterpart of the CPT theorem. 1 A classical PT theorem The following argument is adapted from that in Bell (1955). I cannot quite follow Bell’s argument 1, so I have changed it to generate a result I understand. In outline, the r ..."
Abstract
 Add to MetaCart
, tensor fields, etc — so, for a given theory, an element of Φ will be an ordered mtuple of specified numbers of scalar fields, vector fields, rank 2 tensor fields, etc.) We note that any PDE can be expressed as the vanishing of some functional F: Φ → R M of the fields. (That is, F encodes the dynamics
Reverse data exchange: Coping with nulls
 PODS'09
, 2009
"... An inverse of a schema mapping M is intended to “undo ” what M does, thus providing a way to perform “reverse ” data exchange. In recent years, three different formalizations of this concept have been introduced and studied, namely, the notions of an inverse of a schema mapping, a quasiinverse of a ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
An inverse of a schema mapping M is intended to “undo ” what M does, thus providing a way to perform “reverse ” data exchange. In recent years, three different formalizations of this concept have been introduced and studied, namely, the notions of an inverse of a schema mapping, a quasi
Spatial Reasoning with RCC8 and Connectedness Constraints in Euclidean Spaces
"... The region connection calculus, or RCC8, is a widelystudied formalism for describing topological arrangements of spatial regions. The variables of this language range over the collection of nonempty, regular closed sets of ndimensional Euclidean space, here denoted RC+(Rn), and its nonlogical pr ..."
Abstract
 Add to MetaCart
logical primitives allow us to specify how the interiors, exteriors and boundaries of these sets intersect. The key question is the satisfiability problem: given a finite set of atomic RCC8constraints in m variables, determine whether there exists an mtuple of elements of RC+(Rn) satisfying them. These problems
Applicable Algebra in Engineering, Communication and Computing
, 1992
"... Abstract. Cyclic codes with symbols from a residue class integer ring Z m are characterized in terms of the discrete Fourier transform (DFT) of codewords defined over an appropriate extension ring of Z m. It is shown that a cyclic code of length n over Zm, n relatively prime to m, consists of ntupl ..."
Abstract
 Add to MetaCart
Abstract. Cyclic codes with symbols from a residue class integer ring Z m are characterized in terms of the discrete Fourier transform (DFT) of codewords defined over an appropriate extension ring of Z m. It is shown that a cyclic code of length n over Zm, n relatively prime to m, consists of ntuples
N.Q.: Multitape NFA: Weak synchronization of the input heads
 SOFSEM 2012. LNCS
, 2012
"... Abstract. Given an ntape nondeterministic finite automaton (NFA) M with a oneway readonly head per tape and a right end marker $ on each tape, and a nonnegative integer k, wesaythatM is weakly ksynchronized if for every ntuple x =(x1,...,xn) that is accepted, there is a computation on x such th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Given an ntape nondeterministic finite automaton (NFA) M with a oneway readonly head per tape and a right end marker $ on each tape, and a nonnegative integer k, wesaythatM is weakly ksynchronized if for every ntuple x =(x1,...,xn) that is accepted, there is a computation on x
Results 1  10
of
91