Sciweavers

380 search results - page 13 / 76
» Mapping Problems with Finite-Domain Variables into Problems ...
Sort
View
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
13 years 11 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
BMCBI
2008
85views more  BMCBI 2008»
13 years 7 months ago
Normalizing biomedical terms by minimizing ambiguity and variability
Background: One of the difficulties in mapping biomedical named entities, e.g. genes, proteins, chemicals and diseases, to their concept identifiers stems from the potential varia...
Yoshimasa Tsuruoka, John McNaught, Sophia Ananiado...
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 7 months ago
Static Analysis using Parameterised Boolean Equation Systems
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
María-del-Mar Gallardo, Christophe Joubert,...
CSCLP
2007
Springer
14 years 1 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
FSS
2011
93views more  FSS 2011»
13 years 2 months ago
Upper and lower probabilities induced by a fuzzy random variable
We review two existing interpretations of fuzzy random variables. In the first one, the fuzzy random variable is viewed as a linguistic random variable. In the second case, it re...
Inés Couso, Luciano Sánchez