Sciweavers

7106 search results - page 37 / 1422
» Restricted Complexity, General Complexity
Sort
View
IJCAI
2003
13 years 9 months ago
Decidability of SHIQ with Complex Role Inclusion Axioms
Motivated by medical terminology applications, we investigate the decidability of the well known expressive DL, SHIQ, extended with role inclusion axioms (RIAs) of the form R ◦ ...
Ian Horrocks, Ulrike Sattler
COCO
2000
Springer
65views Algorithms» more  COCO 2000»
13 years 12 months ago
On the Complexity of Quantum ACC
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett
ESANN
2006
13 years 9 months ago
Adaptive Sensor Modelling and Classification using a Continuous Restricted Boltzmann Machine (CRBM)
A probabilistic, ``neural'' approach to sensor modelling and classification is described, performing local data fusion in a wireless system for embedded sensors using a ...
Tong Boon Tang, Alan F. Murray
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
14 years 1 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
ASPDAC
2009
ACM
144views Hardware» more  ASPDAC 2009»
14 years 9 days ago
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
Nikolaos D. Liveris, Hai Zhou, Prithviraj Banerjee