-
1
-
-
0034827438
-
Designing domain-specific processors
-
New York, NY, USA: ACM
-
M. Arnold and H. Corporaal, "Designing domain-specific processors," in Proceedings of the ninth international symposium on Hardware/ software codesign, ser. CODES '01. New York, NY, USA: ACM, 2001, pp. 61-66
-
(2001)
Proceedings of the Ninth International Symposium on Hardware/ Software Codesign, Ser. CODES '01
, pp. 61-66
-
-
Arnold, M.1
Corporaal, H.2
-
2
-
-
0036663707
-
Maximum common subgraph isomorphism algorithms for the matching of chemical structures
-
J. W. Raymond and P. Willett, "Maximum common subgraph isomorphism algorithms for the matching of chemical structures," Journal of Computer-Aided Molecular Design, vol. 16, p. 2002, 2002
-
(2002)
Journal of Computer-Aided Molecular Design
, vol.16
, pp. 2002
-
-
Raymond, J.W.1
Willett, P.2
-
3
-
-
84866035476
-
Fast algorithms for maximal clique enumeration with limited memory
-
New York, NY, USA: ACM
-
J. Cheng, L. Zhu, Y. Ke, and S. Chu, "Fast algorithms for maximal clique enumeration with limited memory," in Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, ser. KDD '12. New York, NY, USA: ACM, 2012, pp. 1240-1248
-
(2012)
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Ser. KDD '12
, pp. 1240-1248
-
-
Cheng, J.1
Zhu, L.2
Ke, Y.3
Chu, S.4
-
4
-
-
84900336551
-
Fast algorithms for the maximum clique problem on massive sparse graphs
-
abs/1209.5818
-
B. Pattabiraman, M. M. A. Patwary, A. H. Gebremedhin, W. keng Liao, and A. N. Choudhary, "Fast algorithms for the maximum clique problem on massive sparse graphs," CoRR, vol. abs/1209.5818, 2012
-
(2012)
CoRR
-
-
Pattabiraman, B.1
Patwary, M.M.A.2
Gebremedhin, A.H.3
Keng Liao, W.4
Choudhary, A.N.5
-
5
-
-
3042658703
-
Llvm: A compilation framework for lifelong program analysis & transformation
-
Washington, DC, USA: IEEE Computer Society
-
C. Lattner and V. Adve, "Llvm: A compilation framework for lifelong program analysis & transformation," in Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization, ser. CGO '04. Washington, DC, USA: IEEE Computer Society, 2004, pp. 75-
-
(2004)
Proceedings of the International Symposium on Code Generation and Optimization: Feedback-directed and Runtime Optimization, Ser. CGO '04
, pp. 75
-
-
Lattner, C.1
Adve, V.2
-
6
-
-
65349083666
-
Modern architectures for embedded reconfigurable systems-a survey
-
L. Józwiak and N. Nedjah, "Modern architectures for embedded reconfigurable systems-a survey," Journal of Circuits, Systems, and Computers, vol. 18, no. 2, pp. 209-254, 2009
-
(2009)
Journal of Circuits, Systems, and Computers
, vol.18
, Issue.2
, pp. 209-254
-
-
Józwiak, L.1
Nedjah, N.2
-
7
-
-
84867368085
-
The instruction-set extension problem: A survey
-
May
-
C. Galuzzi and K. Bertels, "The instruction-set extension problem: A survey," ACM Trans. Reconfigurable Technol. Syst., vol. 4, no. 2, pp. 18:1-18:28, May 2011
-
(2011)
ACM Trans. Reconfigurable Technol. Syst.
, vol.4
, Issue.2
, pp. 181-1828
-
-
Galuzzi, C.1
Bertels, K.2
-
8
-
-
52649095646
-
A retargetable framework for automated discovery of custom instructions
-
July
-
P. Bonzini and L. Pozzi, "A retargetable framework for automated discovery of custom instructions," in Application-specific Systems, Architectures and Processors, 2007. ASAP. IEEE International Conf. on, July 2007, pp. 334-341
-
(2007)
Application-specific Systems, Architectures and Processors, 2007. ASAP. IEEE International Conf. on
, pp. 334-341
-
-
Bonzini, P.1
Pozzi, L.2
-
9
-
-
33744744405
-
Exact and approximate algorithms for the extension of embedded processor instruction sets
-
July
-
L. Pozzi, K. Atasu, and P. Ienne, "Exact and approximate algorithms for the extension of embedded processor instruction sets," Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, vol. 25, no. 7, pp. 1209-1229, July 2006
-
(2006)
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
, vol.25
, Issue.7
, pp. 1209-1229
-
-
Pozzi, L.1
Atasu, K.2
Ienne, P.3
-
10
-
-
49749123811
-
Instruction set extension exploration in multiple-issue architecture
-
New York, NY, USA: ACM
-
I.-W. Wu, Z.-Y. Chen, J.-J. Shann, and C.-P. Chung, "Instruction set extension exploration in multiple-issue architecture," in Proceedings of the Conference on Design, Automation and Test in Europe, ser. DATE '08. New York, NY, USA: ACM, 2008, pp. 764-769
-
(2008)
Proceedings of the Conference on Design, Automation and Test in Europe, Ser. DATE '08
, pp. 764-769
-
-
Wu, I.-W.1
Chen, Z.-Y.2
Shann, J.-J.3
Chung, C.-P.4
-
11
-
-
79958119833
-
Automatic identification of customized instruction based on multiple attribute decision-making for multi-issue architectures
-
June
-
H. Tan and Y. Sun, "Automatic identification of customized instruction based on multiple attribute decision-making for multi-issue architectures," Tsinghua Science and Technology, vol. 16, no. 3, pp. 278-284, June 2011
-
(2011)
Tsinghua Science and Technology
, vol.16
, Issue.3
, pp. 278-284
-
-
Tan, H.1
Sun, Y.2
-
12
-
-
22544461314
-
Efficient datapath merging for partially reconfigurable architectures
-
july
-
N. Moreano, E. Borin, C. de Souza, and G. Araujo, "Efficient datapath merging for partially reconfigurable architectures," Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, vol. 24, no. 7, pp. 969-980, july 2005
-
(2005)
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
, vol.24
, Issue.7
, pp. 969-980
-
-
Moreano, N.1
Borin, E.2
De Souza, C.3
Araujo, G.4
-
13
-
-
70450235127
-
Design-space exploration of resourcesharing solutions for custom instruction set extensions
-
December
-
M. Zuluaga and N. Topham, "Design-space exploration of resourcesharing solutions for custom instruction set extensions," Trans. Comp.-Aided Des. Integ. Cir. Sys., vol. 28, pp. 1788-1801, December 2009
-
(2009)
Trans. Comp.-Aided Des. Integ. Cir. Sys.
, vol.28
, pp. 1788-1801
-
-
Zuluaga, M.1
Topham, N.2
-
15
-
-
0034909407
-
Enumerating all connected maximal common subgraphs in two graphs
-
I. Koch, "Enumerating all connected maximal common subgraphs in two graphs," Theoretical Computer Science, vol. 250, no. 1, pp. 1-30, 2001
-
(2001)
Theoretical Computer Science
, vol.250
, Issue.1
, pp. 1-30
-
-
Koch, I.1
-
16
-
-
84867997005
-
A fast algorithm for the maximum clique problem
-
special devoted to the 6th Twente Workshop on Graphs and Combinatorial Optimization
-
P. R. stergrd, "A fast algorithm for the maximum clique problem," Discrete Applied Mathematics, vol. 120, no. 13, pp. 197-207, 2002, special Issue devoted to the 6th Twente Workshop on Graphs and Combinatorial Optimization
-
(2002)
Discrete Applied Mathematics
, vol.120
, Issue.13
, pp. 197-207
-
-
Stergrd, P.R.1
-
17
-
-
79952688955
-
Parallel algorithms for finding cliques in a graph
-
S. Szab, "Parallel algorithms for finding cliques in a graph," Journal of Physics: Conference Series, vol. 268, no. 1, p. 012030, 2011
-
(2011)
Journal of Physics: Conference Series
, vol.268
, Issue.1
, pp. 012030
-
-
Szab, S.1
-
18
-
-
84914116418
-
A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components
-
abs/1302.6256
-
R. A. Rossi, D. F. Gleich, A. H. Gebremedhin, and M. M. A. Patwary, "A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components," CoRR, vol. abs/1302.6256, 2013
-
(2013)
CoRR
-
-
Rossi, R.A.1
Gleich, D.F.2
Gebremedhin, A.H.3
Patwary, M.M.A.4
-
19
-
-
61449140888
-
A scalable, parallel algorithm for maximal clique enumeration
-
M. C. Schmidt, N. F. Samatova, K. Thomas, and B.-H. Park, "A scalable, parallel algorithm for maximal clique enumeration," Journal of Parallel and Distributed Computing, vol. 69, no. 4, pp. 417-428, 2009.
-
(2009)
Journal of Parallel and Distributed Computing
, vol.69
, Issue.4
, pp. 417-428
-
-
Schmidt, M.C.1
Samatova, N.F.2
Thomas, K.3
Park, B.-H.4
|