Libros sobre el tema "Analysis of encrypted network flow"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 40 mejores mejores libros para su investigación sobre el tema "Analysis of encrypted network flow".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore libros sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Cherukuri, Aswani Kumar, Sumaiya Thaseen Ikram, Gang Li y Xiao Liu. Encrypted Network Traffic Analysis. Cham: Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-62909-9.
Texto completoJensen, Paul A. Network flow programming. Malabar, Fla: R.E. Krieger Pub. Co., 1987.
Buscar texto completoWilliams-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.
Buscar texto completoWilliams-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.
Buscar texto completoWilliams-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.
Buscar texto completoTara, 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.
Buscar texto completoTara, 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.
Buscar texto completoWilliams-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.
Buscar texto completoTara, 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.
Buscar texto completoTara, 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.
Buscar texto completoGoldberg, Andrew V. A natural randomization strategy for multicommodity flow and related algorithms. Stanford, Calif: Dept. of Computer Science, Stanford University, 1991.
Buscar texto completoT, Leighton, ed. Fast approximation algorithms for multicommodity flow problems. Stanford, Calif: Dept. of Computer Science, Stanford University, 1991.
Buscar texto completoJung, Soojung. Roadway network productivity assessment: System-wide analysis under variant travel demand. Washington, D.C: U.S. Dept. of Transportation, Federal Highway Administration, 2009.
Buscar texto completoJanetzke, David C. Efficient computation of aerodynamic influence coefficients for aeroelastic analysis on a transputer network. [Washington, DC]: National Aeronautics and Space Administration, 1991.
Buscar texto completoAntoni, Mazurkiewicz, MONDILEX y Instytut Slawistyki (Polska Akademia Nauk), eds. Time flow and tenses. Warsaw: Slawistyczny Ośrodek Wydawniczy, 2010.
Buscar texto completoAikens, C. Harold. A fixed-charge multicommodity network flow algorithm and a warehouse location application. Monterey, Calif: Naval Postgradute School, 1985.
Buscar texto completoSlatnick, 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.
Buscar texto completoDerigs, Ulrich. Programming in networks and graphs: On the combinatorial background and near-equivalence of network flow and matching algorithms. Berlin: Springer-Verlag, 1988.
Buscar texto completoBoyle, 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.
Buscar texto completoOmang, 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.
Buscar texto completoBrandimarte, Paolo. Introduction to distribution logistics. Hoboken, N.J: John Wiley, 2007.
Buscar texto completoSpirin, Yuriy, Sergey Zotov, Evgeniy Krasnov y Nadezhda Cvetkova. Polder watercourses: research methods and geoecological assessment. ru: INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1903343.
Texto completoIkram, Sumaiya Thaseen. Encrypted Network Traffic Analysis. Springer International Publishing AG, 2024.
Buscar texto completoNetwork flow analysis. San Francisco: No Starch Press, 2010.
Buscar texto completoGarcia-Diaz, Alberto y Don T. Phillips. Fundamentals of Network Analysis and Flow Optimization. Virtualbookworm.com Publishing, Incorporated, 2022.
Buscar texto completoMasao. Network Flow, Transportation, and Scheduling; Theory and Algorithms. Elsevier Science & Technology Books, 2011.
Buscar texto completoSepil, Canan A. Dual simplex algorithms on network flow problems and extensions. 1987.
Buscar texto completoChoi, Wonjoon. Network flow models of building evacuation problems with flow- dependent arc capacities. 1987.
Buscar texto completoJin, Wenlong. Introduction to Network Traffic Flow Theory: Modeling, Analysis, Simulation, and Empirics. Elsevier, 2020.
Buscar texto completoJin, Wenlong. Introduction to Network Traffic Flow Theory: Modeling, Analysis, Simulation, and Empirics. Elsevier, 2021.
Buscar texto completoDerigs, Ulrich. Programming in Networks and Graphs: On the Combinatorial Background and near-Equivalence of Network Flow and Matching Algorithms. Springer London, Limited, 2013.
Buscar texto completoDerigs, Ulrich. Programming in Networks and Graphs: On The Combinatorial Background And Near-Equivalence Of Network Flow And Matching Algorithms. Springer, 1988.
Buscar texto completoLee, Seung-Chul. A new power flow and sensitivity analysis method using a generalized power flow algorithm, interactive computer graphics, and artificial intelligence. 1985.
Buscar texto completoZotteri, Giulio y Paolo Brandimarte. Introduction to Distribution Logistics. Wiley & Sons, Incorporated, John, 2007.
Buscar texto completoZotteri, Giulio y Paolo Brandimarte. Introduction to Distribution Logistics. Wiley & Sons, Incorporated, John, 2007.
Buscar texto completoLight, Ryan y James Moody, eds. The Oxford Handbook of Social Networks. Oxford University Press, 2020. http://dx.doi.org/10.1093/oxfordhb/9780190251765.001.0001.
Texto completoWoolley, Samuel C. y Douglas Guilbeault. United States. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190931407.003.0009.
Texto completoBrughmans, Tom, Anna Collar y Fiona Coward, eds. The Connected Past. Oxford University Press, 2016. http://dx.doi.org/10.1093/oso/9780198748519.001.0001.
Texto completoHerrnson, Paul S. y Justin H. Kirkland. Political Parties and Campaign Finance Networks. Editado por Jennifer Nicoll Victor, Alexander H. Montgomery y Mark Lubell. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780190228217.013.16.
Texto completoPerdigão, Rui A. P. Unfolding the Manifold Flavours of Causality. Meteoceanics Institute, 2024. http://dx.doi.org/10.46337/mdsc.1804.
Texto completo