2950 search results - page 272 / 590 » Computing with Infinitely Many Processes |
199
click to vote
CPM
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
166
click to vote
IEEEICCI
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper describes a system capable of classifying stochastic, self-affine, nonstationary signals produced by nonlinear systems. The classification and analysis of these signals...
192
click to vote
DEXA
2003
Springer
15 years 12 months ago
2003
Springer
Streaming XML documents has many emerging applications. However, in this paper, we show that the restrictions imposed by data streaming are too restrictive for processing twig quer...
182
click to vote
COOPIS
1998
IEEE
15 years 11 months ago
1998
IEEE
Parallel and distributed programming is conceptually harder to undertake and to understand than sequential programming, because a programmer often has to manage the coexistence an...
183
click to vote
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
As application complexity increases, modern embedded systems have adopted heterogeneous processing elements to enhance the computing capability or to reduce the power consumption. ...