Search Sciweavers | Sciweavers

1941 search results - page 11 / 389

» On the Hardness of Approximate Reasoning

click to vote

COCO
1994
Springer

140views Algorithms» more COCO 1994»

Random Debaters and the Hardness of Approximating Stochastic Functions

14 years 3 months ago

Download www.cs.yale.edu

A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...

Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...

claim paper

Read More »

click to vote

EDBT
2010
ACM

110views Database» more EDBT 2010»

The hardness and approximation algorithms for l-diversity

14 years 5 months ago

Download www.cse.cuhk.edu.hk

The existing solutions to privacy preserving publication can be classiﬁed into the theoretical and heuristic categories. The former guarantees provably low information loss, whe...

Xiaokui Xiao, Ke Yi, Yufei Tao

claim paper

Read More »

click to vote

ISAAC
2009
Springer

127views Algorithms» more ISAAC 2009»

Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms

14 years 5 months ago

Download hal.archives-ouvertes.fr

Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...

Laurent Bulteau, Guillaume Fertin, Irena Rusu

claim paper

Read More »

click to vote

FOCS
2008
IEEE

85views Theoretical Computer Science» more FOCS 2008»

Entangled Games are Hard to Approximate

14 years 5 months ago