Sciweavers

438 search results - page 38 / 88
» The Size of a Revised Knowledge Base
Sort
View
DLOG
2001
15 years 7 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
BMCBI
2010
178views more  BMCBI 2010»
15 years 5 months ago
Applications of a formal approach to decipher discrete genetic networks
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...
Fabien Corblin, Eric Fanchon, Laurent Trilling
TCC
2012
Springer
245views Cryptology» more  TCC 2012»
14 years 1 months ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
148
Voted
CLUSTER
2008
IEEE
15 years 7 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...
ESANN
2007
15 years 7 months ago
Controlling complexity of RBF networks by similarity
Abstract. Using radial basis function networks for function approximation tasks suffers from unavailable knowledge about an adequate network size. In this work, a measuring techni...
Ulrich Rückert, Ralf Eickhoff