Sciweavers

3255 search results - page 435 / 651
» Combination of Abstractions in the ASTR
Sort
View
UAI
2007
15 years 7 months ago
A System for Ontologically-Grounded Probabilistic Matching
This paper is part of a project to match descriptions of real-world instances and probabilistic models, both of which can be described at mulvel of abstraction and detail. We use ...
Rita Sharma, David Poole, Clinton Smyth
CRYPTO
2010
Springer
195views Cryptology» more  CRYPTO 2010»
15 years 7 months ago
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product rel...
Tatsuaki Okamoto, Katsuyuki Takashima
BMCBI
2008
114views more  BMCBI 2008»
15 years 6 months ago
The pairwise disconnectivity index as a new metric for the topological analysis of regulatory networks
Background: Currently, there is a gap between purely theoretical studies of the topology of large bioregulatory networks and the practical traditions and interests of experimental...
Anatolij Potapov, Björn Goemann, Edgar Wingen...
CORR
2010
Springer
79views Education» more  CORR 2010»
15 years 6 months ago
Variable elimination for building interpreters
In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (t...
Julien Cohen, Jean-Louis Giavitto, Olivier Michel
167
Voted
CORR
2008
Springer
130views Education» more  CORR 2008»
15 years 6 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux