2412 search results - page 447 / 483 » Which Problems Have Strongly Exponential Complexity |
WWW
2003
ACM
14 years 8 months ago
2003
ACM
The Semantic Web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. To this point, researchers have defined new l...
RECOMB
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. One phylogeny-based approach to horizontal gene transfer (HGT) detection entails comparing the topology of a gene tree to that of the species tree, and using their differ...
ICC
2008
IEEE
14 years 2 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...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract. Denial-of-Service (DoS) attacks remain a challenging problem in the Internet. In a DoS attack the attacker is attempting to make a resource unavailable to its intended le...
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 ...