2498 search results - page 105 / 500 » Data Structures with Unpredictable Timing |
ICCAD
1994
IEEE
15 years 2 months ago
1994
IEEE
- This paper presents a non-scan design-for-testability technique applicable to register-transfer(RT) level data path circuits, which are usually very hard-to-test due to the prese...
FORMATS
2007
Springer
15 years 4 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
SIGMOD
1999
ACM
15 years 2 months ago
1999
ACM
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
PODS
2007
ACM
15 years 10 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
[Extended Abstract] Ken Wakita Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku Tokyo 152-8552, Japan wakita@is.titech.ac.jp Toshiyuki Tsurumi Tokyo Institute of Technolog...