2168 search results - page 389 / 434 » Randomized Algorithms and Complexity Theory |
128
Voted
SEMWEB
2010
Springer
15 years 14 days ago
2010
Springer
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
149
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
263
Voted
IHI
2012
13 years 10 months ago
2012
Despite recent progress in high-throughput experimental studies, systems level visualization and analysis of large protein interaction networks (ppi) remains a challenging task, g...
144
Voted
CCS
2007
ACM
15 years 8 months ago
2007
ACM
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
122
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...