• 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 1 - 10 of 22,574
Next 10 →

Simple Construction of . . .

by Katsutoshi Kusume, Gerhard Bauch - IEEE TRANSACTIONS ON COMMUNICATIONS , 2008
"... ..."
Abstract - Add to MetaCart
Abstract not found

Simple Constructions of Almost k-wise Independent Random Variables

by Noga Alon, Oded Goldreich, Johan Håstad, René Peralta , 1992
"... We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1))(log log n + k/2 + log k + log 1 ɛ), where ɛ is the statistical difference between the dist ..."
Abstract - Cited by 303 (40 self) - Add to MetaCart
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1))(log log n + k/2 + log k + log 1 ɛ), where ɛ is the statistical difference between

The Lifting Scheme: A Construction Of Second Generation Wavelets

by Wim Sweldens , 1997
"... We present the lifting scheme, a simple construction of second generation wavelets, wavelets that are not necessarily translates and dilates of one fixed function. Such wavelets can be adapted to intervals, domains, surfaces, weights, and irregular samples. We show how the lifting scheme leads to a ..."
Abstract - Cited by 539 (15 self) - Add to MetaCart
We present the lifting scheme, a simple construction of second generation wavelets, wavelets that are not necessarily translates and dilates of one fixed function. Such wavelets can be adapted to intervals, domains, surfaces, weights, and irregular samples. We show how the lifting scheme leads

Simple Constructive Weak Factorization

by Jarosław Włodarczyk , 2006
"... We give a simplified algorithm of the functorial weak factorization of birational morphisms of nonsingular varieties over a field of characteristic zero into a composite of blow-ups and blow-downs with smooth centers. ..."
Abstract - Add to MetaCart
We give a simplified algorithm of the functorial weak factorization of birational morphisms of nonsingular varieties over a field of characteristic zero into a composite of blow-ups and blow-downs with smooth centers.

A Simple Estimator of Cointegrating Vectors in Higher Order Cointegrated Systems

by James H. Stock, Mark W. Watson - ECONOMETRICA , 1993
"... Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions. T ..."
Abstract - Cited by 524 (3 self) - Add to MetaCart
Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions

A simple construction of Grassmannian polylogarithms

by A. B. Goncharov , 2010
"... ..."
Abstract - Cited by 45 (0 self) - Add to MetaCart
Abstract not found

A simple construction of bialgebra deformations ∗

by Robert Grossman, David Radford
"... Let A denote a bialgebra over a field k and let At = A[[t]] denote the ring of formal power series with coefficients in A. Assume that A is also isomorphic to a free, associative algebra over k. We give a simple construction which makes At a bialgebra deformation of A. In typical applications, At is ..."
Abstract - Add to MetaCart
Let A denote a bialgebra over a field k and let At = A[[t]] denote the ring of formal power series with coefficients in A. Assume that A is also isomorphic to a free, associative algebra over k. We give a simple construction which makes At a bialgebra deformation of A. In typical applications

On-Line Construction of Suffix Trees

by Esko Ukkonen , 1995
"... An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part of the strin ..."
Abstract - Cited by 437 (2 self) - Add to MetaCart
An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part

Coarse-to-fine n-best parsing and MaxEnt discriminative reranking

by Eugene Charniak, Mark Johnson - In ACL , 2005
"... Discriminative reranking is one method for constructing high-performance statistical parsers (Collins, 2000). A discriminative reranker requires a source of candidate parses for each sentence. This paper describes a simple yet novel method for constructing sets of 50-best parses based on a co ..."
Abstract - Cited by 522 (15 self) - Add to MetaCart
Discriminative reranking is one method for constructing high-performance statistical parsers (Collins, 2000). A discriminative reranker requires a source of candidate parses for each sentence. This paper describes a simple yet novel method for constructing sets of 50-best parses based on a

ERC -- A Theory of Equity, Reciprocity and Competition

by Gary E Bolton, Axel Ockenfels - FORTHCOMING AMERICAN ECONOMIC REVIEW , 1999
"... We demonstrate that a simple model, constructed on the premise that people are motivated by both their pecuniary payoff and their relative payoff standing, explains behavior in a wide variety of laboratory games. Included are games where equity is thought to be a factor, such as ultimatum, two-perio ..."
Abstract - Cited by 738 (21 self) - Add to MetaCart
We demonstrate that a simple model, constructed on the premise that people are motivated by both their pecuniary payoff and their relative payoff standing, explains behavior in a wide variety of laboratory games. Included are games where equity is thought to be a factor, such as ultimatum, two
Next 10 →
Results 1 - 10 of 22,574
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