Livros sobre o tema "Analysis of encrypted network flow"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 40 melhores livros para estudos sobre o assunto "Analysis of encrypted network flow".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Veja os livros das mais diversas áreas científicas e compile uma bibliografia correta.
Cherukuri, Aswani Kumar, Sumaiya Thaseen Ikram, Gang Li e Xiao Liu. Encrypted Network Traffic Analysis. Cham: Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-62909-9.
Texto completo da fonteJensen, Paul A. Network flow programming. Malabar, Fla: R.E. Krieger Pub. Co., 1987.
Encontre o texto completo da fonteWilliams-Sether, Tara. Analysis of the peak-flow gaging network in North Dakota. Bismarck, N.D: U.S. Dept. of the Interior, U.S. Geological Survey, 1996.
Encontre o texto completo da fonteWilliams-Sether, Tara. Analysis of the peak-flow gaging network in North Dakota. Bismarck, N.D: U.S. Dept. of the Interior, U.S. Geological Survey, 1996.
Encontre o texto completo da fonteWilliams-Sether, Tara. Analysis of the peak-flow gaging network in North Dakota. Bismarck, N.D: U.S. Dept. of the Interior, U.S. Geological Survey, 1996.
Encontre o texto completo da fonteTara, Williams-Sether. Analysis of the peak-flow gaging network in North Dakota. Bismarck, N.D: U.S. Dept. of the Interior, U.S. Geological Survey, 1996.
Encontre o texto completo da fonteTara, Williams-Sether. Analysis of the peak-flow gaging network in North Dakota. Bismarck, N.D: U.S. Dept. of the Interior, U.S. Geological Survey, 1996.
Encontre o texto completo da fonteWilliams-Sether, Tara. Analysis of the peak-flow gaging network in North Dakota. Bismarck, N.D: U.S. Dept. of the Interior, U.S. Geological Survey, 1996.
Encontre o texto completo da fonteTara, Williams-Sether. Analysis of the peak-flow gaging network in North Dakota. Bismarck, N.D: U.S. Dept. of the Interior, U.S. Geological Survey, 1996.
Encontre o texto completo da fonteTara, Williams-Sether. Analysis of the peak-flow gaging network in North Dakota. Bismarck, N.D: U.S. Dept. of the Interior, U.S. Geological Survey, 1996.
Encontre o texto completo da fonteGoldberg, Andrew V. A natural randomization strategy for multicommodity flow and related algorithms. Stanford, Calif: Dept. of Computer Science, Stanford University, 1991.
Encontre o texto completo da fonteT, Leighton, ed. Fast approximation algorithms for multicommodity flow problems. Stanford, Calif: Dept. of Computer Science, Stanford University, 1991.
Encontre o texto completo da fonteJung, Soojung. Roadway network productivity assessment: System-wide analysis under variant travel demand. Washington, D.C: U.S. Dept. of Transportation, Federal Highway Administration, 2009.
Encontre o texto completo da fonteJanetzke, David C. Efficient computation of aerodynamic influence coefficients for aeroelastic analysis on a transputer network. [Washington, DC]: National Aeronautics and Space Administration, 1991.
Encontre o texto completo da fonteAntoni, Mazurkiewicz, MONDILEX e Instytut Slawistyki (Polska Akademia Nauk), eds. Time flow and tenses. Warsaw: Slawistyczny Ośrodek Wydawniczy, 2010.
Encontre o texto completo da fonteAikens, C. Harold. A fixed-charge multicommodity network flow algorithm and a warehouse location application. Monterey, Calif: Naval Postgradute School, 1985.
Encontre o texto completo da fonteSlatnick, Jennifer A. Network flow model analysis of the impact of chlorofluorocarbon phaseout on acid-grade fluorspar. Washington, DC: U.S. Dept. of the Interior, Bureau of Mines, 1994.
Encontre o texto completo da fonteDerigs, Ulrich. Programming in networks and graphs: On the combinatorial background and near-equivalence of network flow and matching algorithms. Berlin: Springer-Verlag, 1988.
Encontre o texto completo da fonteBoyle, Edward H. Chromium availability in market economy countries and network flow model analysis of world chromium supply. [PGH, PA]: U.S. Dept. of the Interior, Bureau of Mines, 1993.
Encontre o texto completo da fonteOmang, R. J. Analysis of the magnitude and frequency of floods and the peak-flow gaging network in Montana. Helena, Mont: U.S. Dept. of the Interior, U.S. Geological Survey, 1992.
Encontre o texto completo da fonteBrandimarte, Paolo. Introduction to distribution logistics. Hoboken, N.J: John Wiley, 2007.
Encontre o texto completo da fonteSpirin, Yuriy, Sergey Zotov, Evgeniy Krasnov e Nadezhda Cvetkova. Polder watercourses: research methods and geoecological assessment. ru: INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1903343.
Texto completo da fonteIkram, Sumaiya Thaseen. Encrypted Network Traffic Analysis. Springer International Publishing AG, 2024.
Encontre o texto completo da fonteNetwork flow analysis. San Francisco: No Starch Press, 2010.
Encontre o texto completo da fonteGarcia-Diaz, Alberto, e Don T. Phillips. Fundamentals of Network Analysis and Flow Optimization. Virtualbookworm.com Publishing, Incorporated, 2022.
Encontre o texto completo da fonteMasao. Network Flow, Transportation, and Scheduling; Theory and Algorithms. Elsevier Science & Technology Books, 2011.
Encontre o texto completo da fonteSepil, Canan A. Dual simplex algorithms on network flow problems and extensions. 1987.
Encontre o texto completo da fonteChoi, Wonjoon. Network flow models of building evacuation problems with flow- dependent arc capacities. 1987.
Encontre o texto completo da fonteJin, Wenlong. Introduction to Network Traffic Flow Theory: Modeling, Analysis, Simulation, and Empirics. Elsevier, 2020.
Encontre o texto completo da fonteJin, Wenlong. Introduction to Network Traffic Flow Theory: Modeling, Analysis, Simulation, and Empirics. Elsevier, 2021.
Encontre o texto completo da fonteDerigs, Ulrich. Programming in Networks and Graphs: On the Combinatorial Background and near-Equivalence of Network Flow and Matching Algorithms. Springer London, Limited, 2013.
Encontre o texto completo da fonteDerigs, Ulrich. Programming in Networks and Graphs: On The Combinatorial Background And Near-Equivalence Of Network Flow And Matching Algorithms. Springer, 1988.
Encontre o texto completo da fonteLee, Seung-Chul. A new power flow and sensitivity analysis method using a generalized power flow algorithm, interactive computer graphics, and artificial intelligence. 1985.
Encontre o texto completo da fonteZotteri, Giulio, e Paolo Brandimarte. Introduction to Distribution Logistics. Wiley & Sons, Incorporated, John, 2007.
Encontre o texto completo da fonteZotteri, Giulio, e Paolo Brandimarte. Introduction to Distribution Logistics. Wiley & Sons, Incorporated, John, 2007.
Encontre o texto completo da fonteLight, Ryan, e James Moody, eds. The Oxford Handbook of Social Networks. Oxford University Press, 2020. http://dx.doi.org/10.1093/oxfordhb/9780190251765.001.0001.
Texto completo da fonteWoolley, Samuel C., e Douglas Guilbeault. United States. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190931407.003.0009.
Texto completo da fonteBrughmans, Tom, Anna Collar e Fiona Coward, eds. The Connected Past. Oxford University Press, 2016. http://dx.doi.org/10.1093/oso/9780198748519.001.0001.
Texto completo da fonteHerrnson, Paul S., e Justin H. Kirkland. Political Parties and Campaign Finance Networks. Editado por Jennifer Nicoll Victor, Alexander H. Montgomery e Mark Lubell. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780190228217.013.16.
Texto completo da fontePerdigão, Rui A. P. Unfolding the Manifold Flavours of Causality. Meteoceanics Institute, 2024. http://dx.doi.org/10.46337/mdsc.1804.
Texto completo da fonte