Sciweavers

8431 search results - page 30 / 1687

» Algorithmically Independent Sequences

28

SODA
2001
ACM

108views Algorithms» more SODA 2001»

Approximating coloring and maximum independent sets in 3-uniform hypergraphs

13 years 11 months ago

Approximating coloring and maximum independent sets in 3-uniform hypergraphs

Download www.math.ucla.edu

Michael Krivelevich, Ram Nathaniel, Benny Sudakov

claim paper

Read More »

28

SODA
1993
ACM

107views Algorithms» more SODA 1993»

Chernoff-Hoeffding Bounds for Applications with Limited Independence

13 years 11 months ago

Chernoff-Hoeffding Bounds for Applications with Limited Independence

Download www.cs.umd.edu

Jeanette P. Schmidt, Alan Siegel, Aravind Srinivas...

claim paper

Read More »

24

ESA
2010
Springer

144views Algorithms» more ESA 2010»

Approximation Schemes for Multi-Budgeted Independence Systems

13 years 10 months ago

Approximation Schemes for Multi-Budgeted Independence Systems

Download www.ricoz.net

Fabrizio Grandoni, Rico Zenklusen

claim paper

Read More »

34

BMCBI
2005

162views more BMCBI 2005»

Accelerated probabilistic inference of RNA structure evolution

13 years 9 months ago

Accelerated probabilistic inference of RNA structure evolution

Download biowiki.org

Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...

Ian Holmes

claim paper

Read More »

27

COCO
1994
Springer

100views Algorithms» more COCO 1994»

Relative to a Random Oracle, NP is Not Small

14 years 1 months ago

Relative to a Random Oracle, NP is Not Small

Download www.cs.iastate.edu

Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...

Steven M. Kautz, Peter Bro Miltersen

claim paper

Read More »

« Prev « First page 30 / 1687 Last » Next »