메뉴 건너뛰기




Volumn 23, Issue 2, 2004, Pages 208-215

Effective iterative techniques for fingerprinting design IP

Author keywords

Fingerprint; Intellectual property protection; Iterative optimization; VLSI; Watermark

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER HARDWARE; COMPUTER SOFTWARE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; INTELLECTUAL PROPERTY; OPTIMIZATION; VLSI CIRCUITS;

EID: 1242286077     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2003.822126     Document Type: Article
Times cited : (63)

References (28)
  • 2
    • 1242340079 scopus 로고    scopus 로고
    • Effective iterative techniques for fingerprinting design IP
    • University of Maryland Institute for Advanced Computer Studies (UMIACS), Technical Report UMIACS-TR-2003-79, July
    • A. E. Caldwell, H. Choi, A. B. Kahng, S. Mantik, M. Potkonjak, G. Qu, and J. L. Wong, "Effective Iterative Techniques for Fingerprinting Design IP," University of Maryland Institute for Advanced Computer Studies (UMIACS), Technical Report UMIACS-TR-2003-79, July 2003.
    • (2003)
    • Caldwell, A.E.1    Choi, H.2    Kahng, A.B.3    Mantik, S.4    Potkonjak, M.5    Qu, G.6    Wong, J.L.7
  • 6
    • 0030421294 scopus 로고    scopus 로고
    • VLSI circuit partitioning by cluster-removal using iterative improvement techniques
    • S. Dutt and W. Deng, "VLSI circuit partitioning by cluster-removal using iterative improvement techniques," in Proc. IEEE Int. Conf. Computer-Aided Design, 1996, pp. 194-200.
    • Proc. IEEE Int. Conf. Computer-Aided Design, 1996 , pp. 194-200
    • Dutt, S.1    Deng, W.2
  • 8
    • 27844522089 scopus 로고    scopus 로고
    • Generic and hybrid algorithms for graph coloring
    • C. Fleurent and J. A. Ferland, "Generic and hybrid algorithms for graph coloring," Ann. Oper. Res., vol. 63, pp. 437-461, 1996.
    • (1996) Ann. Oper. Res. , vol.63 , pp. 437-461
    • Fleurent, C.1    Ferland, J.A.2
  • 10
    • 0027201216 scopus 로고
    • A still better performance guarantee for approximate graph coloring
    • M. M. Halldorsson, "A still better performance guarantee for approximate graph coloring," Inform. Processing Lett., vol. 45, no. 1, pp. 19-23, 1995.
    • (1995) Inform. Processing Lett. , vol.45 , Issue.1 , pp. 19-23
    • Halldorsson, M.M.1
  • 12
    • 0001047763 scopus 로고
    • Optimization by simulated annealing: An experimental evaluation II. Graph coloring and number partitioning
    • D. S. Johnson et al., "Optimization by simulated annealing: An experimental evaluation II. Graph coloring and number partitioning," Oper. Res., vol. 39, no. 3, pp. 378-406, 1991.
    • (1991) Oper. Res. , vol.39 , Issue.3 , pp. 378-406
    • Johnson, D.S.1
  • 15
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell Syst. Tech. J., vol. 49, pp. 291-307, 1970.
    • (1970) Bell Syst. Tech. J. , vol.49 , pp. 291-307
    • Kernighan, B.W.1    Lin, S.2
  • 24
    • 0026930899 scopus 로고
    • New search spaces for sequencing problems with application to job shop scheduling
    • R. H. Storer, S. D. Wu, and R. Vaccari, "New search spaces for sequencing problems with application to job shop scheduling," Management Science, vol. 38, pp. 1495-1509, 1992.
    • (1992) Management Science , vol.38 , pp. 1495-1509
    • Storer, R.H.1    Wu, S.D.2    Vaccari, R.3
  • 26
    • 1242340075 scopus 로고    scopus 로고
    • DIMACS Graph Coloring Benchmark [Online]
    • DIMACS Graph Coloring Benchmark [Online]. ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/color/.
  • 27
    • 1242340076 scopus 로고    scopus 로고
    • SATLIB-The Satisfiability Library [Online]
    • SATLIB-The Satisfiability Library [Online]. Available: http://www.satlib.org/.
  • 28
    • 1242317423 scopus 로고    scopus 로고
    • Graph Coloring Instances [Online]
    • Graph Coloring Instances [Online]. Available: http://mat.gsia.cmu.edu/COLOR/instances.html


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.