1998 search results - page 112 / 400 » Complexity of the Cover Polynomial |
RSFDGRC
2005
Springer
14 years 3 months ago
2005
Springer
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
WABI
2005
Springer
14 years 3 months ago
2005
Springer
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
APPROX
2008
Springer
14 years 3 days ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
APWEB
2008
Springer
14 years 3 days ago
2008
Springer
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...