24 search results - page 2 / 5 » An Experimental Study of Algorithms for Fully Dynamic Transi... |
ASPDAC
2004
ACM
13 years 10 months ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
SIGSOFT
1994
ACM
13 years 9 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
ICSM
2008
IEEE
13 years 11 months ago
2008
IEEE
Prior work has shown that computing dynamic slices of erroneous program values can greatly assist in locating the root cause of erroneous behavior by identifying faulty statements...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
We report on a study of topic dynamics for pages visited by a sample of people using MSN Search. We examine the predictive accuracies of probabilistic models of topic transitions ...
ICDM
2007
IEEE
13 years 8 months ago
2007
IEEE
Mining frequent patterns in transaction databases has been studied extensively in data mining research. However, most of the existing frequent pattern mining algorithms do not con...