Sciweavers

1225 search results - page 94 / 245
» The Instance Complexity Conjecture
Sort
View
DBSEC
2003
155views Database» more  DBSEC 2003»
13 years 10 months ago
Schema Based XML Security: RBAC Approach
As a platform-independent solution, XML is going to be used in many environments such as application integration and Web Services. Security of XML instance is a basic problem, esp...
Xinwen Zhang, Jaehong Park, Ravi S. Sandhu
APAL
2007
111views more  APAL 2007»
13 years 9 months ago
A coverage construction of the reals and the irrationals
I modify the standard coverage construction of the reals to obtain the irrationals. However, this causes a jump in ordinal complexity from ω + 1 to Ω. The coverage technique ha...
Harold Simmons
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 9 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
PERCOM
2005
ACM
14 years 8 months ago
Determination of Time and Order for Event-Based Middleware in Mobile Peer-to-Peer Environments
An event correlation is becoming an important service in event-based middleware allowing subscribers in publish/subscribe paradigm to consume patterns of events (composite events)...
Eiko Yoneki, Jean Bacon
CPAIOR
2007
Springer
14 years 3 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...