Search Sciweavers | Sciweavers

17

STACS
2010
Springer

148views Theoretical Computer Science» more STACS 2010»

Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses

13 years 11 months ago

This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...

Xiaoyang Gu, John M. Hitchcock, Aduri Pavan

claim paper

Read More »

14

click to vote

TCS
2008

120views Theoretical Computer Science» more TCS 2008»

Absolute versus probabilistic classification in a logical setting

13 years 5 months ago

Download www.comp.nus.edu.sg

Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...

Sanjay Jain, Eric Martin, Frank Stephan

claim paper

Read More »

15

click to vote

SIGECOM
2009
ACM

137views ECommerce» more SIGECOM 2009»

An exact almost optimal algorithm for target set selection in social networks

13 years 11 months ago

Download www.ii.uib.no

The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...

Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...

claim paper

Read More »

16

click to vote

UAI
2008

251views Artificial Intelligence» more UAI 2008»

Almost Optimal Intervention Sets for Causal Discovery

13 years 6 months ago

Download uai2008.cs.helsinki.fi

We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...

Frederick Eberhardt

claim paper

Read More »

27

click to vote

COMPGEOM
1999
ACM

222views Discrete Geometry» more COMPGEOM 1999»

Computing Roundness is Easy if the Set is Almost Round

13 years 9 months ago