• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 49,421
Next 10 →

Space-time block codes from orthogonal designs

by Vahid Tarokh, Hamid Jafarkhani, A. R. Calderbank - IEEE Trans. Inform. Theory , 1999
"... Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas. ..."
Abstract - Cited by 1524 (42 self) - Add to MetaCart
decoding algorithm. The classical mathematical framework of orthogonal designs is applied to construct space–time block codes. It is shown that space–time block codes constructed in this way only exist for few sporadic values of �. Subsequently, a generalization of orthogonal designs is shown to provide

Policy gradient methods for reinforcement learning with function approximation.

by Richard S Sutton , David Mcallester , Satinder Singh , Yishay Mansour - In NIPS, , 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract - Cited by 439 (20 self) - Add to MetaCart
represented by its own function approximator, independent of the value function, and is updated according to the gradient of expected reward with respect to the policy parameters. Williams's REINFORCE method and actor-critic methods are examples of this approach. Our main new result is to show

How to Use Expert Advice

by Nicolò Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, Manfred K. Warmuth - JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY , 1997
"... We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we make no assumptions about the way the sequence of bits to be predicted is generated. We measure the performance of the ..."
Abstract - Cited by 377 (79 self) - Add to MetaCart
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we make no assumptions about the way the sequence of bits to be predicted is generated. We measure the performance

How Social Security and Medicare Affect Retirement Behavior in a World of Incomplete Markets

by John Rust, Christopher Phelan - ECONOMETRICA , 1997
"... This paper provides an empirical analysis of how the U.S. Social Security and Medicare insurance system affect the labor supply of older males in the presence of incomplete markets for loans, annuities, and health insurance. We estimate a detailed dynamic programming (DP) model of the joint labor ..."
Abstract - Cited by 371 (11 self) - Add to MetaCart
that the DP model is able to account for wide variety of phenomena observed in the data, including the pronounced peaks in the distribution of retirement ages at 62 and 65 (the ages of early and normal eligibility for Social Security benefits, respectively). We identify a significant fraction of “health

Region Filling and Object Removal by Exemplar-Based Image Inpainting

by A. Criminisi, P. Pérez, K. Toyama , 2004
"... A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this problem has been addressed by two classes of algorithms: 1) “texture synthesis” algorithms for generating large image re ..."
Abstract - Cited by 365 (1 self) - Add to MetaCart
, however, is highly dependent on the order in which the filling proceeds. We propose a best-first algorithm in which the confidence in the synthesized pixel values is propagated in a manner similar to the propagation of information in inpainting. The actual color values are computed using exemplar

Market underreaction to open market share repurchases

by David Ikenberry, Josef Lakonishok, Theo Vermaelen - JOURNAL OF FINANCIAL ECONOMICS , 1995
"... We examine long-run firm performance following open market share repurchase announcements, 1980-1990. We find that the average abnormal four-year buy-and-hold return measured after the initial announcement is 12.1%. For ‘value ’ stocks, companies more likely to be repurchasing shares because of unde ..."
Abstract - Cited by 355 (13 self) - Add to MetaCart
of undervaluation, the average abnormal return is 45.3%. For repurchases announced by ‘glamour ’ stocks, where undervaluation is less likely to be an important motive, no positive drift in abnormal returns is observed. Thus, at least with respect to value stocks, the market errs in its initial response and appears

On Lattices, Learning with Errors, Random Linear Codes, and Cryptography

by Oded Regev - In STOC , 2005
"... Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the ‘learning from parity with error’ problem to higher moduli. It can also be viewed as the problem of decoding from a random linear co ..."
Abstract - Cited by 364 (6 self) - Add to MetaCart
-SVP, a special case of SVP. The new cryptosystem is much more efficient than previous cryptosystems: the public key is of size Õ(n2) and encrypting a message increases its size by a factor of Õ(n) (in previous cryptosystems these values are Õ(n4) and Õ(n2), respectively). In fact, under the assumption

Submodular functions, matroids and certain polyhedra

by Jack Edmonds , 2003
"... The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another, abstraction of algebraic dependence or, equivalently, abstraction of the incidence relations in geometric representations of algebra. Often one of the main derived facts is that all ..."
Abstract - Cited by 355 (0 self) - Add to MetaCart
-called independent subsets of E such that (a) Every subset of an independent set is independent, and (b) For every A ⊆ E, every maximal independent subset of A, i.e., every basis of A, has the same cardinality, called the rank, r(A), of A (with respect to M). (This definition is not standard. It is prompted

Computing Discrete Minimal Surfaces and Their Conjugates

by Ulrich Pinkall, Konrad Polthier - EXPERIMENTAL MATHEMATICS , 1993
"... We present a new algorithm to compute stable discrete minimal surfaces bounded by a number of fixed or free boundary curves in R³, S³ and H³. The algorithm makes no restriction on the genus and can handle singular triangulations. For a discrete harmonic map a conjugation process is presented leading ..."
Abstract - Cited by 347 (10 self) - Add to MetaCart
leading in case of minimal surfaces additionally to instable solutions of the free boundary value problem for minimal surfaces. Symmetry properties of boundary curves are respected during conjugation.

Perceived organizational support: A review of the literature

by Linda Rhoades, Robert Eisenberger - Journal of Applied Psychology , 2002
"... The authors reviewed more than 70 studies concerning employees ’ general belief that their work organization values their contribution and cares about their well-being (perceived organizational support; POS). A meta-analysis indicated that 3 major categories of beneficial treatment received by emplo ..."
Abstract - Cited by 334 (3 self) - Add to MetaCart
& Zajac, 1990; Meyer & Allen, 1997; Mowday, Porter, & Steers, 1982). By contrast, employees are generally more concerned with the orga-nization’s commitment to them. Being valued by the organization can yield such benefits as approval and respect, pay and promo-tion, and access
Next 10 →
Results 11 - 20 of 49,421
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University