148 search results - page 30 / 30 » Formally Analyzing Expected Time Complexity of Algorithms Us... |
CODES
2008
IEEE
13 years 11 months ago
2008
IEEE
The heterogeneity of modern MPSoC architectures, coupled with the increasing complexity of the applications mapped onto them has recently led to a lot of interest in hybrid perfor...
STACS
2010
Springer
14 years 7 days ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
VIS
2009
IEEE
14 years 6 months ago
2009
IEEE
In this paper we describe a novel method to integrate interactive visual analysis and machine learning to support the insight generation of the user. The suggested approach combine...