3717 search results - page 7 / 744 » Representing Multiple Theories |
ACL
1997
13 years 9 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
ICPR
2010
IEEE
13 years 6 months ago
2010
IEEE
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
SACMAT
2009
ACM
14 years 2 months ago
2009
ACM
Many access control policy languages, e.g., XACML, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the result...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
IACR
2011
12 years 7 months ago
2011
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...