4908 search results - page 971 / 982 » On the Complexity of Optimal K-Anonymity |
107
click to vote
IJON
2007
14 years 11 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
TCS
2008
14 years 11 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
JALC
2007
14 years 11 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
138
click to vote
BMCBI
2005
14 years 11 months ago
2005
Background: The responses to interleukin 1 (IL-1) in human chondrocytes constitute a complex regulatory mechanism, where multiple transcription factors interact combinatorially to...
107
click to vote
BMCBI
2005
14 years 11 months ago
2005
Background: Accurate assignment of genes to pathways is essential in order to understand the functional role of genes and to map the existing pathways in a given genome. Existing ...