937 search results - page 30 / 188 » On the Complexity of Partial Order Properties |
EDBT
2006
ACM
15 years 10 months ago
2006
ACM
Abstract. Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. The...
CANS
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Predicate encryption is a new powerful cryptographic primitive which allows for fine-grained access control for encrypted data: the owner of the secret key can release pa...
IANDC
2011
14 years 5 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
EDBT
2002
ACM
15 years 10 months ago
2002
ACM
Managing multiple versions of XML documents represents a critical requirement for many applications. Also, there has been much recent interest in supporting complex queries on XML ...