-
3
-
-
0033687401
-
Leveraging legacy system dollars for E-business
-
May
-
E. Erlikh, "Leveraging Legacy System Dollars for E-Business," IEEE IT Professional, vol. 2, no. 3, pp. 17-23, May 2000.
-
(2000)
IEEE IT Professional
, vol.2
, Issue.3
, pp. 17-23
-
-
Erlikh, E.1
-
4
-
-
0021501054
-
An essay on software reuse
-
Sept
-
T. Standish, "An Essay on Software Reuse," IEEE Trans. Software Eng., vol. 10, no. 5, pp. 494-497, Sept. 1984.
-
(1984)
IEEE Trans. Software Eng.
, vol.10
, Issue.5
, pp. 494-497
-
-
Standish, T.1
-
7
-
-
78650549619
-
-
Dec
-
Java Transaction API (JTA), "http://java.sun.com/javaee/ technologies/jta/index.jsp," Dec. 2008.
-
(2008)
Java Transaction API (JTA)
-
-
-
8
-
-
36849095568
-
Efficient mining of iterative patterns for software specification discovery
-
D. Lo, S.-C. Khoo, and C. Liu, "Efficient Mining of Iterative Patterns for Software Specification Discovery," Proc. ACM SIGKDD, 2007.
-
(2007)
Proc ACM SIGKDD
-
-
Lo, D.1
Khoo, S.-C.2
Liu, C.3
-
10
-
-
27144468394
-
Discovery of frequent episodes in event sequences
-
H. Mannila, H. Toivonen, and A. Verkamo, "Discovery of Frequent Episodes in Event Sequences," Data Mining and Knowledge Discovery, vol. 1, pp. 259-289, 1997. (Pubitemid 127721244)
-
(1997)
Data Mining and Knowledge Discovery
, vol.1
, Issue.3
, pp. 259-289
-
-
Mannila, H.1
Toivonen, H.2
Verkamo, I.3
-
11
-
-
0035393979
-
LSCs: Breathing life into message sequence charts
-
W. Damm and D. Harel, "LSCs: Breathing Life into Message Sequence Charts," Formal Methods in System Design, vol. 19, pp. 45-80, 2001.
-
(2001)
Formal Methods in System Design
, vol.19
, pp. 45-80
-
-
Damm, W.1
Harel, D.2
-
12
-
-
78650532322
-
Discovering frequent closed itemsets for association rules
-
N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Discovering Frequent Closed Itemsets for Association Rules," Proc. Symp. Principles of Database Systems, 1999.
-
(1999)
Proc. Symp. Principles of Database Systems
-
-
Pasquier, N.1
Bastide, Y.2
Taouil, R.3
Lakhal, L.4
-
13
-
-
33750743089
-
Minimum description length principle: Generators are preferable to closed patterns
-
J. Li, H. Li, L. Wong, J. Pei, and G. Dong, "Minimum Description Length Principle: Generators Are Preferable to Closed Patterns," Proc. AAAI Conf. Artificial Intelligence, 2006.
-
(2006)
Proc. AAAI Conf. Artificial Intelligence
-
-
Li, J.1
Li, H.2
Wong, L.3
Pei, J.4
Dong, G.5
-
14
-
-
36849044170
-
Mining statistically important equivalence classes and delta-discriminative emerging patterns
-
J. Li, G. Liu, and L. Wong, "Mining Statistically Important Equivalence Classes and Delta-Discriminative Emerging Patterns," Proc. ACM SIGKDD, 2007.
-
(2007)
Proc ACM SIGKDD
-
-
Li, J.1
Liu, G.2
Wong, L.3
-
17
-
-
33847009318
-
Managing interesting rules in sequence mining
-
Principles of Data Mining and Knowledge Discovery
-
M. Spiliopoulou, "Managing Interesting Rules in Sequence Mining," Proc. European Conf. Principles of Data Mining and Knowledge Discovery, 1999.
-
(1999)
Proc. European Conf
-
-
Spiliopoulou, M.1
-
18
-
-
67349106769
-
Efficient mining of recurrent rules from a sequence database
-
Database Systems for Advanced Applications
-
D. Lo, S.-C. Khoo, and C. Liu, "Efficient Mining of Recurrent Rules from a Sequence Database," Proc. Int'l Conf. Database Systems for Advanced Applications, 2008.
-
(2008)
Proc. Int'l Conf
-
-
Lo, D.1
Khoo, S.-C.2
Liu, C.3
-
20
-
-
78650543597
-
-
Dec
-
"MarkingQueuedIrps," http//msdn.microsoft.com/en-us/library/ aa469118.aspx, Dec. 2008.
-
(2008)
MarkingQueuedIrps
-
-
-
23
-
-
36849088200
-
Discovering unbounded episodes in sequential data
-
Principles of Data Mining and Knowledge Discovery
-
G. Garriga, "Discovering Unbounded Episodes in Sequential Data," Proc. European Conf. Principles of Data Mining and Knowledge Discovery, 2003.
-
(2003)
Proc. European Conf.
-
-
Garriga, G.1
-
24
-
-
29944442006
-
Mining periodic patterns with gap requirement from sequences
-
M. Zhang, B. Kao, D. Cheung, and K. Yip, "Mining Periodic Patterns with Gap Requirement from Sequences," Proc. ACM SIGMOD, 2005.
-
(2005)
Proc ACM SIGMOD
-
-
Zhang, M.1
Kao, B.2
Cheung, D.3
Yip, K.4
-
25
-
-
67649646374
-
Efficient mining of closed repetitive gapped subsequences from a sequence database
-
B. Ding, D. Lo, J. Han, and S.-C. Khoo, "Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database," Proc. IEEE Int'l Conf. Data Eng., 2009.
-
(2009)
Proc IEEE Int'l Conf. Data Eng
-
-
Ding, B.1
Lo, D.2
Han, J.3
Khoo, S.-C.4
-
26
-
-
57349176926
-
Efficient mining of frequent sequence generators
-
C. Gao, J. Wang, Y. He, and L. Zhou, "Efficient Mining of Frequent Sequence Generators," Proc. Int'l Conf. World Wide Web (Poster), 2008.
-
(2008)
Proc. Int'l Conf. World Wide Web (Poster)
-
-
Gao, C.1
Wang, J.2
He, Y.3
Zhou, L.4
-
30
-
-
78650542407
-
Temporal logic for scenario-based specifications
-
Tools and Algorithms for the Construction and Analysis of Systems
-
H. Kugler, D. Harel, A. Pnueli, Y. Lu, and Y. Bontemps, "Temporal Logic for Scenario-Based Specifications," Proc. Int'l Conf. Tools and Algorithms for the Construction and Analysis of Systems, 2005.
-
(2005)
Proc. Int'l Conf.
-
-
Kugler, H.1
Harel, D.2
Pnueli, A.3
Lu, Y.4
Bontemps, Y.5
-
31
-
-
0025401691
-
Cecil: A sequencing constraint language for automatic static analysis generation
-
Mar
-
K. Olender and L. Osterweil, "Cecil: A Sequencing Constraint Language for Automatic Static Analysis Generation," IEEE Trans. Software Eng., vol. 16, no. 3, pp. 268-280, Mar. 1990.
-
(1990)
IEEE Trans. Software Eng.
, vol.16
, Issue.3
, pp. 268-280
-
-
Olender, K.1
Osterweil, L.2
-
33
-
-
0035016443
-
Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth
-
J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu, "Prefixspan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth," Proc. IEEE Int'l Conf. Data Eng., 2001.
-
(2001)
Proc IEEE Int'l Conf. Data Eng
-
-
Pei, J.1
Han, J.2
Mortazavi-Asl, B.3
Pinto, H.4
Chen, Q.5
Dayal, U.6
Hsu, M.-C.7
-
34
-
-
0001880210
-
KDD-Cup 2000 organizers' report: Peeling the onion
-
R. Kohavi, C. Brodley, B. Frasca, L. Mason, and Z. Zheng, "KDD-Cup 2000 Organizers' Report: Peeling the Onion," ACM SIGKDD Explorations, vol. 2, pp. 86-98, 2000.
-
(2000)
ACM SIGKDD Explorations
, vol.2
, pp. 86-98
-
-
Kohavi, R.1
Brodley, C.2
Frasca, B.3
Mason, L.4
Zheng, Z.5
-
35
-
-
0028166441
-
Experiments on the effectiveness of dataflow-and control-flow-based test adequacy criteria
-
M. Hutchins, H. Foster, T. Goradia, and T. Ostrand, "Experiments on the Effectiveness of Dataflow-and Control-Flow-Based Test Adequacy Criteria," Proc. Int'l Conf. Software Eng., 1994.
-
(1994)
Proc. Int'l Conf. Software Eng
-
-
Hutchins, M.1
Foster, H.2
Goradia, T.3
Ostrand, T.4
-
37
-
-
33845432883
-
Summarizing the content of large traces to facilitate the understanding of the behaviour of a software system
-
A. Hamou-Lhadj and T. Lethbridge, "Summarizing the Content of Large Traces to Facilitate the Understanding of the Behaviour of a Software System," Proc. IEEE Int'l Conf. Program Comprehension, 2006.
-
(2006)
Proc IEEE Int'l Conf. Program Comprehension
-
-
Hamou-Lhadj, A.1
Lethbridge, T.2
|