Results 1  10
of
4,015
A simple variant of the . . .
"... We give a simple proof of a variant of the qbinomial theorem which generalizes a result by S. Nalci and O. Pashaev. We give a simple proof of a variant of the q binomial Theorem which generalizes a result obtained by S. Nalci and O. Pashaev [2]. ..."
Abstract
 Add to MetaCart
We give a simple proof of a variant of the qbinomial theorem which generalizes a result by S. Nalci and O. Pashaev. We give a simple proof of a variant of the q binomial Theorem which generalizes a result obtained by S. Nalci and O. Pashaev [2].
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 543 (13 self)
 Add to MetaCart
has run for M steps, with M sufficiently large, the distribution governing the state of the chain approximates the desired distribution. Unfortunately it can be difficult to determine how large M needs to be. We describe a simple variant of this method that determines on its own when to stop
Least angle regression
, 2004
"... The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope to s ..."
Abstract

Cited by 1326 (37 self)
 Add to MetaCart
versions of the simpler LARS algorithm. (3) A simple approximation for the degrees of freedom of a LARS estimate is available, from which we derive a Cp estimate of prediction error; this allows a principled choice among the range of possible LARS estimates. LARS and its variants are computationally
Gossipbased ad hoc routing
, 2002
"... Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossipingbased approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. G ..."
Abstract

Cited by 379 (4 self)
 Add to MetaCart
Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossipingbased approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols
A note on the generative power of some simple variants of contextfree grammars regulated by context conditions
 LATA 2009 proceedings, volume 5457 of Lecture Notes in Computer Science
, 2009
"... Abstract. This paper answers three open questions concerning the generative power of some simple variants of contextfree grammars regulated by context conditions. Specifically, it discusses the generative power of socalled contextfree semiconditional grammars (which are random context grammars w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. This paper answers three open questions concerning the generative power of some simple variants of contextfree grammars regulated by context conditions. Specifically, it discusses the generative power of socalled contextfree semiconditional grammars (which are random context grammars
On Clusterings: Good, Bad and Spectral
, 2003
"... We motivate and develop a natural bicriteria measure for assessing the quality of a clustering which avoids the drawbacks of existing measures. A simple recursive heuristic is shown to have polylogarithmic worstcase guarantees under the new measure. The main result of the paper is the analysis of ..."
Abstract

Cited by 332 (11 self)
 Add to MetaCart
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering which avoids the drawbacks of existing measures. A simple recursive heuristic is shown to have polylogarithmic worstcase guarantees under the new measure. The main result of the paper is the analysis
Approximating the nondominated front using the Pareto Archived Evolution Strategy
 EVOLUTIONARY COMPUTATION
, 2000
"... We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its ..."
Abstract

Cited by 321 (19 self)
 Add to MetaCart
We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its
Minimax Estimation via Wavelet Shrinkage
, 1992
"... We attempt to recover an unknown function from noisy, sampled data. Using orthonormal bases of compactly supported wavelets we develop a nonlinear method which works in the wavelet domain by simple nonlinear shrinkage of the empirical wavelet coe cients. The shrinkage can be tuned to be nearly minim ..."
Abstract

Cited by 321 (29 self)
 Add to MetaCart
method (kernel, smoothing spline, sieve,:::) in a minimax sense. Variants of our method based on simple threshold nonlinearities are nearly minimax. Our method possesses the interpretation of spatial adaptivity: it reconstructs using a kernel which mayvary in shape and bandwidth from point to point
A Correspondence Theory for Terminological Logics: Preliminary Report
 In Proc. of IJCAI91
, 1991
"... We show that the terminological logic ALC comprising Boolean operations on concepts and value restrictions is a notational variant of the propositional modal logic K (m) . To demonstrate the utility of the correspondence, we give two of its immediate byproducts. Namely, we axiomatize ALC and give a ..."
Abstract

Cited by 307 (0 self)
 Add to MetaCart
We show that the terminological logic ALC comprising Boolean operations on concepts and value restrictions is a notational variant of the propositional modal logic K (m) . To demonstrate the utility of the correspondence, we give two of its immediate byproducts. Namely, we axiomatize ALC and give
Simple linear work suffix array construction
, 2003
"... Abstract. Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space efficiency while theoreticians use suffix trees due to lineartime construction algorithms and more exp ..."
Abstract

Cited by 215 (8 self)
 Add to MetaCart
explicit structure. We narrow this gap between theory and practice with a simple lineartime construction algorithm for suffix arrays. The simplicity is demonstrated with a C++ implementation of 50 effective lines of code. The algorithm is called DC3, which stems from the central underlying concept
Results 1  10
of
4,015