Sciweavers

796 search results - page 49 / 160
» Approximating the centroid is hard
Sort
View
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 1 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
ICTAI
2003
IEEE
14 years 28 days ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
FM
2006
Springer
146views Formal Methods» more  FM 2006»
13 years 11 months ago
Exact and Approximate Strategies for Symmetry Reduction in Model Checking
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
Alastair F. Donaldson, Alice Miller
DLOG
2009
13 years 5 months ago
Soundness Preserving Approximation for TBox Reasoning in R
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
SCAM
2006
IEEE
14 years 1 months ago
Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through Animation
This paper addresses the question: “How can animated visualisation be used to express interesting properties of static analysis?” The particular focus is upon static dependenc...
David Binkley, Mark Harman, Jens Krinke