626 search results - page 124 / 126 » Towards a Unified Programming Language |
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
BMCBI
2007
13 years 9 months ago
2007
Motivation: With more and more research dedicated to literature mining in the biomedical domain, more and more systems are available for people to choose from when building litera...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
ICS
2009
Tsinghua U.
14 years 4 months ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
DSRT
2008
IEEE
14 years 4 months ago
2008
IEEE
The DEVS formalism has been adopted and developed independently by many research teams, which led to various DEVS implementation versions. Consequently, different DEVS implementat...