Results 1  10
of
417
Model Checking Programs
, 2003
"... The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers. In this pape ..."
Abstract

Cited by 592 (63 self)
 Add to MetaCart
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers
Some General Theorems of Incremental
, 2009
"... work. We extend to incremental thermoelectroelasticity with biasing fields certain classical theorems, that have been stated and proved in linear thermopiezoelectricity referred to a natural configuration. A uniqueness theorem for the solutions to the initial boundary value problem, the generalized ..."
Abstract
 Add to MetaCart
work. We extend to incremental thermoelectroelasticity with biasing fields certain classical theorems, that have been stated and proved in linear thermopiezoelectricity referred to a natural configuration. A uniqueness theorem for the solutions to the initial boundary value problem, the generalized
Distributed compressed sensing
, 2005
"... Compressed sensing is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for reconstruction. In this paper we introduce a new theory for distributed compressed sensing (DCS) that enables new distributed coding algori ..."
Abstract

Cited by 136 (26 self)
 Add to MetaCart
moderate number of signals. In some sense DCS is a framework for distributed compression of sources with memory, which has remained a challenging problem for some time. DCS is immediately applicable to a range of problems in sensor networks and arrays.
A Lyapunov approach to incremental stability
"... . This paper deals with several notions of incremental stability. In other words, we focus on stability of trajectories with respect to one another, rather than with respect some attractor or equilibrium point. The aim is to present a framework for understanding such questions fully compatible with ..."
Abstract

Cited by 113 (2 self)
 Add to MetaCart
. This paper deals with several notions of incremental stability. In other words, we focus on stability of trajectories with respect to one another, rather than with respect some attractor or equilibrium point. The aim is to present a framework for understanding such questions fully compatible
Universal prediction of individual sequences
 IEEE Transactions on Information Theory
, 1992
"... AbstructThe problem of predicting the next outcome of an individual binary sequence using finite memory, is considered. The finitestate predictability of an infinite sequence is defined as the minimum fraction of prediction errors that can be made by any finitestate (FS) predictor. It is proved t ..."
Abstract

Cited by 181 (13 self)
 Add to MetaCart
that this FS predictability can be attained by universal sequential prediction schemes. Specifically, an efficient prediction procedure based on the incremental parsing procedure of the LempelZiv data compression algorithm is shown to achieve asymptotically the FS predictability. Finally, some relations
LinearTime, Incremental Hierarchy Inference for Compression
 Data Compression Conference, Snowbird, Utah, IEEE Computer Society
, 1997
"... this paper, we present three new results that characterize SEQUITUR's computational and compression performance. First, we prove that SEQUITUR operates in time linear in n, the length of the input sequence, despite its ability to build a hierarchy as deep as log(n). Second, we show that a seque ..."
Abstract

Cited by 33 (3 self)
 Add to MetaCart
sequence can be compressed incrementally, improving on the nonincremental algorithm that was described by NevillManning et al. (1994), and making online compression feasible. Third, we present an intriguing result that emerged during benchmarking; whereas PPMC (Moffat, 1990) outperforms SEQUITUR on most
An Extreme Value Theorem on the Standardized Increments of Partial Sums
"... For an independently and identically distributed Gaussian sequence, X 1 , X 2 , . . . , X n , we consider the maximum of its standardized increments of partial sums (denoted by M I n ). We show that it has nearly the same asymptotic distribution as the maximum of the sequence. This result can be v ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
be viewed as an improvement over DarlingErdostype theorem, which can be viewed as an improvement over Law of Iterated Logarithm. It extends some results in increments. The key point in the proof is to construct a set of subsequences with dyadic lengths and use it to approximate consecutive subsequences
On the ergodicity properties of some adaptive MCMC algorithms
 Annals of Applied Probability
"... In this paper we study the ergodicity properties of some adaptive Monte Carlo Markov chain algorithms (MCMC) that have been recently proposed in the literature. We prove that under a set of verifiable conditions, ergodic averages calculated from the output of a socalled adaptive MCMC sampler conver ..."
Abstract

Cited by 101 (12 self)
 Add to MetaCart
converge to the required value and can even, under more stringent assumptions, satisfy a central limit theorem. We prove that the conditions required are satisfied for the Independent MetropolisHastings algorithm and the Random Walk Metropolis algorithm with symmetric increments. Finally we propose
OneUnambiguous Regular Languages
 Information and computation
, 1997
"... The ISO standard for the Standard Generalized Markup Language (SGML) provides a syntactic metalanguage for the definition of textual markup systems. In the standard, the righthand sides of productions are based on regular expressions, although only regular expressions that denote words unambigu ..."
Abstract

Cited by 132 (9 self)
 Add to MetaCart
word has at most one witness. But the SGML standard also requires that a witness be computed incrementally from the word with a onesymbol lookahead; we call such regular expressions 1unambiguous. A regular language is a 1unambiguous language if it is denoted by some 1unambiguous regular
Variable Length Markov Chains
 Annals of Statistics
, 1999
"... We study estimation in the class of stationary variable length Markov chains (VLMC) on a finite space. The processes in this class are still Markovian of higher order, but with memory of variable length yielding a much bigger and structurally richer class of models than ordinary higher order Markov ..."
Abstract

Cited by 134 (5 self)
 Add to MetaCart
power by finding a better tradeoff between model bias and variance and allows better structural description which can be of specific interest. The latter is exemplified with some DNA data. A version of the treestructured context algorithm, proposed by Rissanen (1983) in an information theoretical set
Results 1  10
of
417