1242 search results - page 167 / 249 » A Computational Complexity Theory in Membrane Computing |
134
click to vote
SEMWEB
2010
Springer
2010
Springer
Theoretical foundations and engineering tools for building ontologies as reference conceptual models
14 years 4 months ago
Abstract. Perhaps the most fundamental notion underlying the desiderata for a successful Semantic Web is Semantic Interoperability. In this context, ontologies have been more and m...
132
click to vote
TCAD
2010
14 years 4 months ago
2010
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
166
click to vote
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
109
click to vote
SIAMCOMP
2012
13 years 6 days ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
124
click to vote
DIMACS
1996
14 years 11 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...