Sciweavers

3663 search results - page 39 / 733
» Problems in the ontology of computer programs
Sort
View
CSFW
2011
IEEE
12 years 8 months ago
The Complexity of Quantitative Information Flow Problems
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...
AUIC
2000
IEEE
14 years 1 months ago
Programming without a Computer: A New Interface for Children under Eight
Electronic Blocks are a new programming interface, designed for children aged between three and eight years. The Electronic Blocks programming environment includes sensor blocks, ...
Peta Wyeth, Helen C. Purchase
AI
2004
Springer
13 years 8 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
ECCV
2000
Springer
14 years 10 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
SEMWEB
2005
Springer
14 years 2 months ago
Modeling Degrees of Conceptual Overlap in Semantic Web Ontologies
Information retrieval systems have to deal with uncertain knowledge and query results should reflect this uncertainty in some manner. However, Semantic Web ontologies are based on...
Markus Holi, Eero Hyvönen