Results 1  10
of
5,192
On certain formulas of Karlin and Szegö
"... Some identities due to Karlin and Szegö which provide a relationship between determinants of classical orthogonal polynomials of Wronskian and Hankel type are shown to be specializations of a general algebraic identity between minors of a matrix. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Some identities due to Karlin and Szegö which provide a relationship between determinants of classical orthogonal polynomials of Wronskian and Hankel type are shown to be specializations of a general algebraic identity between minors of a matrix.
On Certain Formulas For The Multivariable Hypergeometric Functions
, 1995
"... . We present relatively simple and direct proofs of the integral representations established recently in [7]. An algorithm is then furnished and applied to obtain new classes of integral formulas for the multivariable hypergeometric functions, thereby, providing generalizations to the results of [7] ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. We present relatively simple and direct proofs of the integral representations established recently in [7]. An algorithm is then furnished and applied to obtain new classes of integral formulas for the multivariable hypergeometric functions, thereby, providing generalizations to the results of [7
CERTAIN FORMULAS INVOLVING EULERIAN NUMBERS
"... Abstract. In contrast with numerous identities involving the binomial coefficients and the Stirling numbers of the first and second kinds, a few identities involving the Eulerian numbers have been known. The objective of this note is to present certain interesting and (presumably) new identities in ..."
Abstract
 Add to MetaCart
Abstract. In contrast with numerous identities involving the binomial coefficients and the Stirling numbers of the first and second kinds, a few identities involving the Eulerian numbers have been known. The objective of this note is to present certain interesting and (presumably) new identities
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 620 (53 self)
 Add to MetaCart
a certain state. Also the problems of receptiveness, realizability, and controllability can be formulated as modelchecking problems for alternatingtime formulas.
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
, 2001
"... Variable selection is fundamental to highdimensional statistical modeling, including nonparametric regression. Many approaches in use are stepwise selection procedures, which can be computationally expensive and ignore stochastic errors in the variable selection process. In this article, penalized ..."
Abstract

Cited by 948 (62 self)
 Add to MetaCart
functions are symmetric, nonconcave on (0, ∞), and have singularities at the origin to produce sparse solutions. Furthermore, the penalty functions should be bounded by a constant to reduce bias and satisfy certain conditions to yield continuous solutions. A new algorithm is proposed for optimizing
On limits of wireless communications in a fading environment when using multiple antennas
 Wireless Personal Communications
, 1998
"... Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bitrates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multielement array (M ..."
Abstract

Cited by 2426 (14 self)
 Add to MetaCart
(MEA) technology, that is processing the spatial dimension (not just the time dimension) to improve wireless capacities in certain applications. Specifically, we present some basic information theory results that promise great advantages of using MEAs in wireless LANs and building to building wireless
A simple proof of certain formula for multiple zetastar values
 J. Alg., Number Theory: Adv. Appl
"... Abstract This paper presents a simple and algebraic proof of certain identity on the noncommutative polynomial algebra y x, Q to show the BowmanBradley theorem for multiple zetastar values. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract This paper presents a simple and algebraic proof of certain identity on the noncommutative polynomial algebra y x, Q to show the BowmanBradley theorem for multiple zetastar values.
Notes On Formalizing Context
, 1993
"... These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit axiomatizat ..."
Abstract

Cited by 417 (9 self)
 Add to MetaCart
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit
Noise strategies for improving local search
 In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI94
, 1994
"... It has recently been shown that local search issurprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basic local search methods can be further enhanced by introducing mechanisms for escaping from local minima in the search spac ..."
Abstract

Cited by 400 (7 self)
 Add to MetaCart
It has recently been shown that local search issurprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basic local search methods can be further enhanced by introducing mechanisms for escaping from local minima in the search
Local Search Strategies for Satisfiability Testing
 DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
, 1995
"... It has recently been shown that local search is surprisingly good at finding satisfying assignments for certain classes of CNF formulas [24]. In this paper we demonstrate that the power of local search for satisfiability testing can be further enhanced by employinga new strategy, called "mixed ..."
Abstract

Cited by 311 (28 self)
 Add to MetaCart
It has recently been shown that local search is surprisingly good at finding satisfying assignments for certain classes of CNF formulas [24]. In this paper we demonstrate that the power of local search for satisfiability testing can be further enhanced by employinga new strategy, called "
Results 1  10
of
5,192