1461 search results - page 289 / 293 » Complexity of Graph Covering Problems |
SEMWEB
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Most Semantic Web applications are build on top of technology based on the Semantic Web layer cake and the W3C ontology languages RDF(S) and OWL. However RDF(S) embodies ...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
COMSWARE
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
ISMIR
2004
Springer
14 years 25 days ago
2004
Springer
Measuring the similarity between rhythms is a fundamental problem in computational music theory, with many applications such as music information retrieval and copyright infringem...