Results 11  20
of
6,224
A strong version of the redundancycapacity theorem of universal coding
 IEEE TRANS. INFORM. THEORY
, 1995
"... The capacity of the channel induced by a given class of sources is well known to be an attainable lower bound on the redundancy of universal codes with respect to this class, both in the minimax sense and in the Bayesian (maximin) sense. We show that this capacity is essentially a lower bound also ..."
Abstract

Cited by 57 (9 self)
 Add to MetaCart
The capacity of the channel induced by a given class of sources is well known to be an attainable lower bound on the redundancy of universal codes with respect to this class, both in the minimax sense and in the Bayesian (maximin) sense. We show that this capacity is essentially a lower bound also in a stronger sense, that is, for “most ” sources in the class. This result extends Rissanen’s lower bound for parametric families. We demonstrate the applicability of this result in several examples, e.g., parametric families with growing dimensionality, piecewisefixed sources, arbitrarily varying sources, and noisy samples of learnable functions. Finally, we discuss implications of our results to statistical inference.
A STRONG VERSION OF THE BIRKHOFF–JAMES ORTHOGONALITY IN HILBERT C∗MODULES
, 2014
"... In this paper we introduce a strong version of the Birkhoff–James orthogonality in Hilbert C ∗modules. More precisely, we consider elements x and y of a Hilbert C ∗module V over a C ∗algebra A which satisfy ‖x ‖ ≤ ‖x + ya ‖ for all a ∈ A. We show that this relation can be described as the Birkho ..."
Abstract
 Add to MetaCart
In this paper we introduce a strong version of the Birkhoff–James orthogonality in Hilbert C ∗modules. More precisely, we consider elements x and y of a Hilbert C ∗module V over a C ∗algebra A which satisfy ‖x ‖ ≤ ‖x + ya ‖ for all a ∈ A. We show that this relation can be described
WEAK AND STRONG VERSIONS OF THE 123 CONJECTURE FOR UNIFORM HYPERGRAPHS
, 2015
"... Given an runiform hypergraph H = (V,E) and a weight function ω: E → {1,..., w}, a coloring of vertices of H, induced by ω, is defined by c(v) =∑ e3v w(e) for all v ∈ V. If there exists such a coloring that is strong (that means in each edge no color appears more than once), then we say that H is ..."
Abstract
 Add to MetaCart
Given an runiform hypergraph H = (V,E) and a weight function ω: E → {1,..., w}, a coloring of vertices of H, induced by ω, is defined by c(v) =∑ e3v w(e) for all v ∈ V. If there exists such a coloring that is strong (that means in each edge no color appears more than once), then we say that H
Strong Version of the Basic Deciding Algorithm for the Existential Theory of Real Fields
, 1999
"... Let U be a real algebraic set in ndimensional affine space which is given as a set of zeros of a family of polynomials of degrees less than d. Let U i , i 2 I be the family of all irreducible components of U . Let U (s) i be the closure in the classical topology of the set of all smooth point ..."
Abstract
 Add to MetaCart
Let U be a real algebraic set in ndimensional affine space which is given as a set of zeros of a family of polynomials of degrees less than d. Let U i , i 2 I be the family of all irreducible components of U . Let U (s) i be the closure in the classical topology of the set of all smooth points of dimension s of U i . In the paper an algorithm is described for constructing a finite set S of points of U which has a nonempty intersection with every connected component of every U (s) i for every i 2 I, 0 s n. The number of points of S is bounded from above by a polynomial in d n . The similar result is valid for basic semialgebraic sets. The working time of the algorithm (for the case of algebraic varieties) is polynomial in the size of input and d n . More precise formulations are given below involving triangulations of U if U is bounded (respectively of the Alexandrov compactification of U if U is not bounded). Research partially supported by the Volkswagen...
A unified framework for monetary theory and policy analysis.
 Journal of Political Economy,
, 2005
"... Searchtheoretic models of monetary exchange are based on explicit descriptions of the frictions that make money essential. However, tractable versions of these models typically make strong assumptions that render them ill suited for monetary policy analysis. We propose a new framework, based on ex ..."
Abstract

Cited by 375 (53 self)
 Add to MetaCart
Searchtheoretic models of monetary exchange are based on explicit descriptions of the frictions that make money essential. However, tractable versions of these models typically make strong assumptions that render them ill suited for monetary policy analysis. We propose a new framework, based
Probabilistic Simulations for Probabilistic Processes
, 1994
"... Several probabilistic simulation relations for probabilistic systems are defined and evaluated according to two criteria: compositionality and preservation of "interesting" properties. Here, the interesting properties of a system are identified with those that are expressible in an untimed ..."
Abstract

Cited by 361 (19 self)
 Add to MetaCart
in an untimed version of the Timed Probabilistic concurrent Computation Tree Logic (TPCTL) of Hansson. The definitions are made, and the evaluations carried out, in terms of a general labeled transition system model for concurrent probabilistic computation. The results cover weak simulations, which abstract
Efficient Capital Market: II” ,
 Journal of Finance, No
, 1991
"... SEQUELS ARE RARELY AS good as the originals, so I approach this review of the market efflciency literature with trepidation. The task is thornier than it was 20 years ago, when work on efficiency was rather new. The literature is now so large that a full review is impossible, and is not attempted h ..."
Abstract

Cited by 337 (0 self)
 Add to MetaCart
precondition for this strong version of the hypothesis is that information and trading costs, the costs of getting prices to reflect information, are always 0 (Grossman and Stiglitz (1980)). A weaker and economically more sensible version of the efficiency hypothesis says that prices reflect information
Second simulation of the satellite signal in the solar spectrum, 6S: An Overview
, 1997
"... Remote sensing from satellite or airborne platforms of land or sea surfaces in the visible and near infrared is strongly affected by the presence of the atmosphere along the path from Sun to Target (surface) to Sensor. This paper presents 6S (Second Simulation of the Satellite Signal in the Solar S ..."
Abstract

Cited by 284 (17 self)
 Add to MetaCart
Remote sensing from satellite or airborne platforms of land or sea surfaces in the visible and near infrared is strongly affected by the presence of the atmosphere along the path from Sun to Target (surface) to Sensor. This paper presents 6S (Second Simulation of the Satellite Signal in the Solar
Discovering similar multidimensional trajectories
 In ICDE
, 2002
"... We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that makes all previously used metrics fail. Therefore, here we formalize nonmetric similarity functions based on the Longest C ..."
Abstract

Cited by 260 (6 self)
 Add to MetaCart
. Efficient approximate algorithms that compute these similarity measures are also provided. We compare these new methods to the widely used Euclidean and Time Warping distance functions (for real and synthetic data) and show the superiority of our approach, especially under the strong presence of noise. We
Results 11  20
of
6,224