2950 search results - page 87 / 590 » Computing with Infinitely Many Processes |
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
EUROPAR
2004
Springer
14 years 3 months ago
2004
Springer
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
ARTS
1997
Springer
14 years 1 months ago
1997
Springer
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
CHES
2007
Springer
14 years 1 months ago
2007
Springer
Graphics Processing Units (GPUs) present large potential performance gains within stream processing applications over the standard CPU. These performance gains are best realised wh...
NIPS
2007
13 years 11 months ago
2007
Natural sounds are structured on many time-scales. A typical segment of speech, for example, contains features that span four orders of magnitude: Sentences (∼1 s); phonemes (âˆ...