24 search results - page 2 / 5 » An Experimental Study of Algorithms for Fully Dynamic Transi... |
110
Voted
ASPDAC
2004
ACM
15 years 9 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...
152
Voted
SIGSOFT
1994
ACM
15 years 7 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...
133
Voted
ICSM
2008
IEEE
15 years 10 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...
108
Voted
WWW
2005
ACM
16 years 4 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 ...
132
Voted
ICDM
2007
IEEE
15 years 7 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...