-
1
-
-
84957796178
-
On covering and rank problems for boolean matrices and their applications
-
Computing and Combinatorics: 5th Annual International Conference, COCOON'99, of, Springer-Verlag
-
C. Damm, K. H. Kim, and F. Roush. On covering and rank problems for boolean matrices and their applications. In Computing and Combinatorics: 5th Annual International Conference, COCOON'99, volume 1627 of Lecture Notes in Computer Science, pages 123 - 133. Springer-Verlag, 1999.
-
(1999)
Lecture Notes in Computer Science
, vol.1627
, pp. 123-133
-
-
Damm, C.1
Kim, K.H.2
Roush, F.3
-
3
-
-
84992227458
-
Proposed nist standard for role-based access control
-
D. Ferraiolo, R. Sandhu, S. Gavilla, D. Kuhn, and R. Chandramouli. Proposed nist standard for role-based access control. TISSEC, 2001.
-
(2001)
TISSEC
-
-
Ferraiolo, D.1
Sandhu, R.2
Gavilla, S.3
Kuhn, D.4
Chandramouli, R.5
-
6
-
-
35048813595
-
Tiling databases
-
Discovery Science, Springer-Verlag
-
F. Geerts, B. Goethals, and T. Mielikainen. Tiling databases. In Discovery Science, Lecture Notes in Computer Science, pages 278-289. Springer-Verlag, 2004.
-
(2004)
Lecture Notes in Computer Science
, pp. 278-289
-
-
Geerts, F.1
Goethals, B.2
Mielikainen, T.3
-
7
-
-
0039253846
-
-
J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In W. Chen, J. Naughton, and P. A. Bernstein, editors, 2000 ACM SIGMOD Intl. Conference on Management of Data, pages 1-12. ACM Press, 05 2000.
-
J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In W. Chen, J. Naughton, and P. A. Bernstein, editors, 2000 ACM SIGMOD Intl. Conference on Management of Data, pages 1-12. ACM Press, 05 2000.
-
-
-
-
8
-
-
0000947357
-
Approximating clique and biclique problems
-
D. S. Hochbaum. Approximating clique and biclique problems. J. Algorithms, 29(1):174-200, 1998.
-
(1998)
J. Algorithms
, vol.29
, Issue.1
, pp. 174-200
-
-
Hochbaum, D.S.1
-
11
-
-
51249163234
-
Ordering d-classes and computing schein rank is hard
-
G. Markowsky. Ordering d-classes and computing schein rank is hard. Semi-group Forum, 44:373-375, 1992.
-
(1992)
Semi-group Forum
, vol.44
, pp. 373-375
-
-
Markowsky, G.1
-
12
-
-
34548020220
-
-
T. Mielikäinen. Intersecting data to closed sets with constraints. In B. Goethals and M. J. Zaki, editors, FIMI, 90 of CEUR Workshop Proceedings. CEUR-WS.org, 2003.
-
T. Mielikäinen. Intersecting data to closed sets with constraints. In B. Goethals and M. J. Zaki, editors, FIMI, volume 90 of CEUR Workshop Proceedings. CEUR-WS.org, 2003.
-
-
-
-
13
-
-
34548041366
-
-
master's thesis. Master's thesis, University of Helsinki
-
P. Miettinen. The discrete basis problem, master's thesis. Master's thesis, University of Helsinki, 2006.
-
(2006)
The discrete basis problem
-
-
Miettinen, P.1
-
14
-
-
33750356685
-
The discrete basis problem
-
Knowledge Discovery in Databases: PKDD 2006
-
P. Miettinen, T. Mielikainen, A. Gionis, G. Das, and H. Mannila. The discrete basis problem. In Knowledge Discovery in Databases: PKDD 2006, Lecture Notes in Artificial Intelligence, pages 335-346, 2006.
-
(2006)
Lecture Notes in Artificial Intelligence
, pp. 335-346
-
-
Miettinen, P.1
Mielikainen, T.2
Gionis, A.3
Das, G.4
Mannila, H.5
-
15
-
-
9444294939
-
On finding large conjunctive clusters
-
Learning Theory and Kernel Machines: 16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, of, Springer
-
N. Mishra, D. Ron, and R. Swaminathan. On finding large conjunctive clusters. In Learning Theory and Kernel Machines: 16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, volume 2777 of Lecture Notes in Computer Science, pages 448-462. Springer, 2003.
-
(2003)
Lecture Notes in Computer Science
, vol.2777
, pp. 448-462
-
-
Mishra, N.1
Ron, D.2
Swaminathan, R.3
-
16
-
-
77952367051
-
Carpenter: Finding closed patterns in long biological datasets
-
F. Pan, G. Cong, A. K. H. Tung, J. Yang, and M. J. Zaki. Carpenter: finding closed patterns in long biological datasets. In KDD, pages 637-642, 2003.
-
(2003)
KDD
, pp. 637-642
-
-
Pan, F.1
Cong, G.2
Tung, A.K.H.3
Yang, J.4
Zaki, M.J.5
-
17
-
-
0141998079
-
The maximum edge biclique problem is np-complete
-
R. Peeters. The maximum edge biclique problem is np-complete. Discrete Appl. Math., 131(3):651-654, 2003.
-
(2003)
Discrete Appl. Math
, vol.131
, Issue.3
, pp. 651-654
-
-
Peeters, R.1
-
18
-
-
0030086382
-
Role-based Access Control Models
-
February
-
R. S. Sandhu et al. Role-based Access Control Models. IEEE Computer, pages 38-47, February 1996.
-
(1996)
IEEE Computer
, pp. 38-47
-
-
Sandhu, R.S.1
|