76 search results - page 5 / 16 » On the Computational Complexity of Verifying One-Counter Pro... |
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
SSDBM
1999
IEEE
13 years 11 months ago
1999
IEEE
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
PDPTA
2010
13 years 5 months ago
2010
- Complex business service systems, such as SOA system, are prone to suffer from reliability problem. Various legend applications compatible in SOA system make things worse. Softwa...
CADE
2004
Springer
14 years 7 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
BMCBI
2008
13 years 7 months ago
2008
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...