Results 1  10
of
1,660
Combinatorial limitations of a strong form of list decoding
 Electronic Colloquium on Computational Complexity (ECCC
, 2012
"... We prove the following results concerning the combinatorics of list decoding, motivated by the exponential gap between the known upper bound (of O(1/γ)) and lower bound (of Ωp(log(1/γ))) for the listsize needed to decode up to radius p with rate γ away from capacity, i.e., 1 − h(p) − γ (here p ∈ (0 ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
circumvent this barrier. • We show a “reverse connection ” showing that constantweight codes for list decoding imply general codes for list decoding with higher rate. This shows that the best possible listsize, as a function of the gap γ of the rate to the capacity limit, is the same up to constant factors
Combinatorial Limitations of Averageradius List Decoding
"... We study certain combinatorial aspects of listdecoding, motivated by the exponential gap between the known upper bound (of O(1/γ)) and lower bound (of Ωp(log(1/γ))) for the listsize needed to list decode up to error fraction p with rate γ away from capacity, i.e., 1−h(p)−γ (here p ∈ (0, 1 2) and ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study certain combinatorial aspects of listdecoding, motivated by the exponential gap between the known upper bound (of O(1/γ)) and lower bound (of Ωp(log(1/γ))) for the listsize needed to list decode up to error fraction p with rate γ away from capacity, i.e., 1−h(p)−γ (here p ∈ (0, 1 2
Singular Combinatorics
 ICM 2002 VOL. III 13
, 2002
"... Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit probability distributions present in large random structures. " ..."
Abstract

Cited by 800 (10 self)
 Add to MetaCart
Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit probability distributions present in large random structures
Beyond the Combinatorial Limit in Depth Minimization for LUTBased FPGA Designs
 Proc. IEEE Int'l Conf. on ComputerAided Design
, 1993
"... In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depthoptimal FlowMap algorithm. The new algorithm, named FlowSYN, uses the global combinatorial optimization techniques to guide the Boolean synthesis process during depth mi ..."
Abstract

Cited by 17 (11 self)
 Add to MetaCart
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depthoptimal FlowMap algorithm. The new algorithm, named FlowSYN, uses the global combinatorial optimization techniques to guide the Boolean synthesis process during depth
Estimating Attributes: Analysis and Extensions of RELIEF
, 1994
"... . In the context of machine learning from examples this paper deals with the problem of estimating the quality of attributes with and without dependencies among them. Kira and Rendell (1992a,b) developed an algorithm called RELIEF, which was shown to be very efficient in estimating attributes. Origi ..."
Abstract

Cited by 474 (25 self)
 Add to MetaCart
. Original RELIEF can deal with discrete and continuous attributes and is limited to only twoclass problems. In this paper RELIEF is analysed and extended to deal with noisy, incomplete, and multiclass data sets. The extensions are verified on various artificial and one well known realworld problem. 1
What Transcription Factors Can’t Do: On the Combinatorial Limits of Gene Regulatory Networks
"... A proof is presented that gene regulatory networks (GRNs) based solely on transcription factors cannot control the development of complex multicellular life. GRNs alone cannot explain the evolution of multicellular life in the Cambrian Explosion. Networks are based on addressing systems which are u ..."
Abstract
 Add to MetaCart
of complex multicellular life. However, it is shown in this article that transcription factors do not have sufficient combinatorial power to serve as the basis of an addressing system for regulatory control of genomes in the development of complex organisms. It is proven that given n transcription factor
Combinatorial Auctions with Decreasing Marginal Utilities
, 2001
"... This paper considers combinatorial auctions among such submodular buyers. The valuations of such buyers are placed within a hierarchy of valuations that exhibit no complementarities, a hierarchy that includes also OR and XOR combinations of singleton valuations, and valuations satisfying the gross s ..."
Abstract

Cited by 202 (25 self)
 Add to MetaCart
it to the case of limited complementarities. No such approximation algorithm exists in a setting allowing for arbitrary complementarities. Some results about strategic aspects of combinatorial auctions among players with decreasing marginal utilities are also presented.
On schemes of combinatorial transcription logic.
 Proc. Natl. Acad. Sci. USA
, 2003
"... Cells receive a wide variety of cellular and environmental signals, which are often processed combinatorially to generate specific genetic responses. Here we explore theoretically the potentials and limitations of combinatorial signal integration at the level of cisregulatory transcription control. ..."
Abstract

Cited by 141 (1 self)
 Add to MetaCart
Cells receive a wide variety of cellular and environmental signals, which are often processed combinatorially to generate specific genetic responses. Here we explore theoretically the potentials and limitations of combinatorial signal integration at the level of cisregulatory transcription control
Putting Auction Theory to Work: The Simultaneous Ascending Auction
 Journal of Political Economy
, 2000
"... I review the uses of economic theory in the initial design and later improvement of the ‘‘simultaneous ascending auction,’ ’ which was developed initially for the sale of radio spectrum licenses in the United States. I analyze some capabilities and limitations of the auction, the roles of various de ..."
Abstract

Cited by 271 (21 self)
 Add to MetaCart
I review the uses of economic theory in the initial design and later improvement of the ‘‘simultaneous ascending auction,’ ’ which was developed initially for the sale of radio spectrum licenses in the United States. I analyze some capabilities and limitations of the auction, the roles of various
Raxmliii: a fast program for maximum likelihoodbased inference of large phylogenetic trees
 Bioinformatics
, 2005
"... Motivation: The computation of large phylogenetic trees with statistical models such as maximum likelihood or bayesian inference is computationally extremely intensive. It has repeatedly been demonstrated that these models are able to recover the true tree or a tree which is topologically closer to ..."
Abstract

Cited by 259 (17 self)
 Add to MetaCart
to the true tree more frequently than less elaborate methods such as parsimony or neighbor joining. Due to the combinatorial and computational complexity the size of trees which can be computed on a Biologist’s PC workstation within reasonable time is limited to trees containing approximately 100 taxa
Results 1  10
of
1,660