Sciweavers

7106 search results - page 187 / 1422
» Restricted Complexity, General Complexity
Sort
View
156
Voted
CSR
2007
Springer
15 years 9 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
165
Voted
TDSC
2008
152views more  TDSC 2008»
15 years 3 months ago
Towards Formal Verification of Role-Based Access Control Policies
Specifying and managing access control policies is a challenging problem. We propose to develop formal verification techniques for access control policies to improve the current s...
Somesh Jha, Ninghui Li, Mahesh V. Tripunitara, Qih...
217
Voted
ICDT
2009
ACM
128views Database» more  ICDT 2009»
16 years 4 months ago
Efficient asymmetric inclusion between regular expression types
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
Dario Colazzo, Giorgio Ghelli, Carlo Sartiani
139
Voted
ISBI
2004
IEEE
16 years 4 months ago
Probabilistic ICA for fMRI
Independent Component Analysis is becoming a popular exploratory method for analysing complex data such as that from FMRI experiments. The application of such `model-free' me...
Christian Beckmann
145
Voted
PODS
2008
ACM
143views Database» more  PODS 2008»
16 years 3 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin