Littérature scientifique sur le sujet « Cuppen Divide and Conquer »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Cuppen Divide and Conquer ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Cuppen Divide and Conquer"
Thangavelu, Govindarajan, et Colin C. Anderson. « Divide and conquer ». Chimerism 2, no 1 (janvier 2011) : 29–32. http://dx.doi.org/10.4161/chim.15083.
Texte intégralTanenbaum, Leora, Sherrye Henry, Rene Denfeld et Barbara Findlen. « Divide and Conquer ? » Women's Review of Books 12, no 9 (juin 1995) : 5. http://dx.doi.org/10.2307/4022083.
Texte intégralKester, Grant H. « Divide and Conquer ». Afterimage 18, no 8 (1 mars 1991) : 4. http://dx.doi.org/10.1525/aft.1991.18.8.4.
Texte intégralD'Ambrosia, Robert. « Divide and Conquer ». Orthopedics 11, no 12 (décembre 1988) : 1643. http://dx.doi.org/10.3928/0147-7447-19881201-05.
Texte intégralNeville-Neil, George V. « Divide and Conquer ». Queue 19, no 3 (30 juin 2021) : 37–39. http://dx.doi.org/10.1145/3475965.3477581.
Texte intégralNeville-Neil, George V. « Divide and conquer ». Communications of the ACM 64, no 10 (octobre 2021) : 25. http://dx.doi.org/10.1145/3481431.
Texte intégralMushtaq, Najum. « Divide and conquer ». Bulletin of the Atomic Scientists 63, no 1 (1 janvier 2007) : 17–19. http://dx.doi.org/10.2968/063001005.
Texte intégralBeran, Michael J., Andrew J. Kelly, Bonnie M. Perdue, Will Whitham, Melany Love, Victoria Kelly et Audrey E. Parrish. « Divide and Conquer ». Experimental Psychology 66, no 4 (juillet 2019) : 296–309. http://dx.doi.org/10.1027/1618-3169/a000454.
Texte intégralCrow, Diana. « Divide and Conquer ». Scientific American 315, no 2 (19 juillet 2016) : 14–15. http://dx.doi.org/10.1038/scientificamerican0816-14b.
Texte intégralNunes-Alves, Cláudio. « Divide and conquer ». Nature Reviews Microbiology 12, no 12 (10 novembre 2014) : 794. http://dx.doi.org/10.1038/nrmicro3387.
Texte intégralThèses sur le sujet "Cuppen Divide and Conquer"
Courtois, Jérôme. « Leak study of cryptosystem implementations in randomized RNS arithmetic ». Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS290.
Texte intégralWe will speak of strong analysis for an analysis which makes it possible to find the key to a cryptographic system. We define a weak analysis in the case where candidate keys are eliminated. The goal of this thesis is to understand the behavior of the random of Hamming distances produced by an ECC (Elliptic Curve for Cryptography) cryptographic system when using a RNS (Residue Number System) representation with the random moduli method. Chapter 2 introduces the different concepts for understanding this document. He brieflyintroducesthemodularmultiplicationalgorithm(MontgomeryalgorithmforRNS) which inspired the method of random moduli. Then it describes the algorithm which generatestheHammingdistancesequencesnecessaryforouranalysis. Thenitshowswhat level of resistance brings the method of random moduli against different classic attacks like DPA (Diferrential Power Analysis), CPA (Correlation Power Analysis), DPA of the second order and MIA (Mutual Information Analysis). We provide an understanding of the distribution of Hamming distances considered to be random variables. Following this, we add the Gaussian hypothesis on Hamming distances. We use MLE (Maximum Likelihood Estimator) and a strong analysis as to make Template Attacks to have a fine understanding of the level of random brought by the method of random moduli. The last Chapter 4 begins by briefly introducing the algorithmic choices which have been made to solve the problems of inversion of covariance matrices (symmetric definite positive) of Section 2.5 and the analysis of strong relationships between Hamming in Section 3.2. We use here Graphics Processing Unit (GPU) tools on a very large number of small size matrices. We talk about Batch Computing. The LDLt method presented at the beginning of this chapter proved to be insufficient to completely solve the problem of conditioned MLE presented in Section 3.4. We present work on the improvement of a diagonalization code of a tridiagonal matrix using the principle of Divide & Conquer developed by Lokmane Abbas-Turki and Stéphane Graillat. We present a generalization of this code, optimizations in computation time and an improvement of the accuracy of computations in simple precision for matrices of size lower than 32
Pantawongdecha, Payut. « Autotuning divide-and-conquer matrix-vector multiplication ». Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/105968.
Texte intégralThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 73-75).
Divide and conquer is an important concept in computer science. It is used ubiquitously to simplify and speed up programs. However, it needs to be optimized, with respect to parameter settings for example, in order to achieve the best performance. The problem boils down to searching for the best implementation choice on a given set of requirements, such as which machine the program is running on. The goal of this thesis is to apply and evaluate the Ztune approach [14] on serial divide-and-conquer matrix-vector multiplication. We implemented Ztune to autotune serial divide-and-conquer matrix-vector multiplication on machines with different hardware configurations, and found that Ztuneoptimized codes ran 1%-5% faster than the hand-optimized counterparts. We also compared Ztune-optimized results with other matrix-vector multiplication libraries including the Intel Math Kernel Library and OpenBLAS. Since the matrix-vector multiplication problem is a level 2 BLAS, it is not as computationally intensive as level 3 BLAS problems such as matrix-matrix multiplication and stencil computation. As a result, the measurement in matrix-vector multiplication is more prone to error from factors such as noise, cache alignment of the matrix, and cache states, which lead to wrong decision choices for Ztune. We explored multiple options to get more accurate measurements and demonstrated the techniques that remedied these issues. Lastly, we applied the Ztune approach to matrix-matrix multiplication, and we were able to achieve 2%-85% speedup compared to the hand-tuned code. This thesis represents joint work with Ekanathan Palamadai Natarajan.
by Payut Pantawongdecha.
M. Eng.
Jewell, Sean William. « Divide and conquer sequential Monte Carlo for phylogenetics ». Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/54514.
Texte intégralScience, Faculty of
Statistics, Department of
Graduate
Piper, Andrew James. « Object-oriented divide-and-conquer for parallel processing ». Thesis, University of Cambridge, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337783.
Texte intégralScardillo, Mike, et Mike Nisel. « Divide and Conquer : Improving Post-Flight Data Processing ». International Foundation for Telemetering, 1994. http://hdl.handle.net/10150/608595.
Texte intégralThis paper describes Dryden Flight Research Center's (DFRC's) transition from a mainframe-oriented post-flight data processing system, heavily dependent upon manual operation and scheduling, to a modern, distributed, highly automated system. After developing requirements and a concept development plan, DFRC replaced one multiple-CPU mainframe with five specialized servers, distributing the processing workload and separating functions. Access to flight data was improved by buying and building client server automated retrieval software that takes advantage of the local area network, and by providing over 500 gigabytes of on-line archival storage space. Engineering customers see improved access times and continuous availability (7-days per week, 24-hours per day) of flight research data. A significant reduction in computer operator workload was achieved, and minimal computer operator intervention is now required for flight data retrieval operations. This new post-flight system architecture was designed and built to provide flexibility, extensibility and cost-effective upgradeability. Almost two years of successful operation have proven the viability of the system. Future improvements will focus on decreasing the elapsed time between raw data capture and engineering unit data archival, increasing the on-line archival storage capacity, and decreasing the automated data retrieval response time.
Khoshfetrat, Pakazad Sina. « Divide and Conquer : Distributed Optimization and Robustness Analysis ». Doctoral thesis, Linköpings universitet, Reglerteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-117503.
Texte intégralYu, Fangqing. « A divide-and-conquer method for 3D capacitance extraction ». Thesis, Texas A&M University, 2003. http://hdl.handle.net/1969.1/166.
Texte intégralMoinuddin, Md. « A divide and conquer approach for large spatial dataset ». Doctoral thesis, Università degli studi di Padova, 2019. http://hdl.handle.net/11577/3425417.
Texte intégralNegli ultimi due decenni l'avvento dei \textit{big-data} ha portato sfide computazionali in tutte le principali discipline della ricerca scientifica. Anche la Statistica spaziale sta affrontando questa sfida. Quando un modello parametrico viene proposto per \textit{big-data}, la stima parametrica e la quantificazione dell'incertezza nella stima comporta un carico computazionale importante. Per questo sono stati proposti molti metodi per gestire queste sfide quali la riduzione della dimensionalit\`a, l'approssimazione mediante campi casuali di Markov, la rastremazione \textit{tapering} della matrice di covarianza e approcci basati sul campionamento. In questa tesi si propone un nuovo approccio \textit{divide-and-conquer} detto \texttt{farmer} per la stima e la valutazione dell'incertezza dei parametri in modelli spaziali in presenza di grandi moli di dati spaziali. Secondo l'approccio proposto tutte le osservazioni vengono divise in blocchi mutualmente esclusivi secondo la loro posizione e per ogni blocco si stimano i parametri del modello. Le stime vengono quindi ricombinate tramite un meta-modello a effetti fissi o casuali per tenere conto della (eventuale) dipendenza spaziale. Il metodo risulta completamente generale e può essere applicato ad un ampia gamma di modelli spaziali A titolo d'esempio viene considerato un modello spaziale lineare gaussiano. In uno studio di simulazione gli stimatori \texttt{farmer} sono stati confrontati con stimatori che si basano sulla medesima idea di campionamento Sempre nel contesto del modello gaussiano si presentano due applicazioni con dati reali. Il metodo proposto \`{e} risultato computazionalmente efficiente rispetto ai metodi concorrenti, con distorsione delle stime inferiore. Inoltre, l'approccio proposto fornisce una stima pi\`{u} realistica degli errori standard. Infine si propone un'applicazione del metodo a modelli spaziali lineari generalizzati per dati di conteggio simulati e reali.
Esmaeili, Javad. « Parallel implementation of funtional languages using divide-and-conquer strategies ». Thesis, University of Salford, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.308109.
Texte intégralSimpson, Leonie Ruth. « Divide and conquer attacks on shift register based stream ciphers ». Thesis, Queensland University of Technology, 2000.
Trouver le texte intégralLivres sur le sujet "Cuppen Divide and Conquer"
Cummins, Maureen. Divide & conquer. Rosendale, N.Y.] : [Women's Studio Workshop], 2007.
Trouver le texte intégralDivide & conquer. [Place of publication not identified] : Murray Mcdonald, 2011.
Trouver le texte intégralill, Mercado Jorge, et Aesop, dir. Divide to conquer. Houston : Advance Pub., 2009.
Trouver le texte intégralClancy, Tom. Divide and conquer. New York : Simon & Schuster Audio, 2000.
Trouver le texte intégralCopyright Paperback Collection (Library of Congress), dir. Divide and conquer. New York : Berkley Pub. Group, 2000.
Trouver le texte intégralSmith, Diana McLain. Divide or Conquer. New York : Penguin Group (USA), Inc., 2008.
Trouver le texte intégralClancy, Tom. Divide and conquer. New York : Berkley Books, 2000.
Trouver le texte intégral1947-, Clancy Tom, et Pieczenik Steve, dir. Divide and conquer. London : HarperCollins, 2000.
Trouver le texte intégralClancy, Tom. Divide and Conquer. New York : Penguin USA, Inc., 2009.
Trouver le texte intégralill, Mercado Jorge, et Aesop, dir. Divide to conquer = : Divide y venceras. Houston : Advance Pub., 2009.
Trouver le texte intégralChapitres de livres sur le sujet "Cuppen Divide and Conquer"
Al-Haj Baddar, Sherenaz W., et Kenneth E. Batcher. « Divide and Conquer ». Dans Designing Sorting Networks, 43–47. New York, NY : Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1851-1_7.
Texte intégralFreeman, Kassie. « Divide and Conquer ». Dans Community Engagement in Higher Education, 31–39. Rotterdam : SensePublishers, 2015. http://dx.doi.org/10.1007/978-94-6300-007-9_2.
Texte intégralCynkin, Thomas M. « Divide and Conquer ». Dans Soviet and American Signalling in the Polish Crisis, 68–108. London : Palgrave Macmillan UK, 1988. http://dx.doi.org/10.1007/978-1-349-09694-7_3.
Texte intégralSkiena, Steven S. « Divide and Conquer ». Dans Texts in Computer Science, 147–69. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-54256-6_5.
Texte intégralShekhar, Shashi, et Hui Xiong. « Divide and Conquer ». Dans Encyclopedia of GIS, 254. Boston, MA : Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_321.
Texte intégralCarpenter, Stanley D. M., Kevin J. Delamer, James R. McIntyre et Andrew T. Zwilling. « Divide and Conquer ». Dans The War of American Independence, 1763-1783, 99–119. London : Routledge, 2022. http://dx.doi.org/10.4324/9781003041276-7.
Texte intégralIzadkhah, Habib. « Divide and Conquer ». Dans Problems on Algorithms, 351–400. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17043-0_10.
Texte intégralDu, Ding-Zhu, Panos Pardalos, Xiaodong Hu et Weili Wu. « Divide-and-Conquer ». Dans Introduction to Combinatorial Optimization, 13–41. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10596-8_2.
Texte intégralDixon, Andrew. « Divide and Conquer ». Dans Practical Guide to IT Problem Management, 37–40. Boca Raton : Auerbach Publications, 2022. http://dx.doi.org/10.1201/9781003119975-8.
Texte intégralSherine, Anli, Mary Jasmine, Geno Peter et S. Albert Alexander. « Divide and Conquer ». Dans Algorithm and Design Complexity, 43–73. Boca Raton : CRC Press, 2023. http://dx.doi.org/10.1201/9781003355403-2.
Texte intégralActes de conférences sur le sujet "Cuppen Divide and Conquer"
Zhang, Chuanjun, et Bing Xue. « Divide-and-conquer ». Dans the 23rd international conference. New York, New York, USA : ACM Press, 2009. http://dx.doi.org/10.1145/1542275.1542291.
Texte intégralLyons, Kathy M., et Ryan Thomas Sharpe. « Divide & ; conquer ». Dans Proceeding of the 39th ACM annual conference. New York, New York, USA : ACM Press, 2011. http://dx.doi.org/10.1145/2070364.2070368.
Texte intégralAmato, Ariel, Angel D. Sappa, Alicia Fornés, Felipe Lumbreras et Josep Lladós. « Divide and conquer ». Dans the 2nd ACM international workshop. New York, New York, USA : ACM Press, 2013. http://dx.doi.org/10.1145/2506364.2506371.
Texte intégralNakano, Aiichiro, Shinnosuke Hattori, Rajiv K. Kalia, Weiwei Mou, Ken-ichi Nomura, Pankaj Rajak, Priya Vashishta et al. « Divide-Conquer-Recombine ». Dans Beowulf '14 : Workshop in Honor of Thomas Sterling's 65th Birthday. New York, NY, USA : ACM, 2014. http://dx.doi.org/10.1145/2737909.2737911.
Texte intégralShi, Tao, Hui Ma et Gang Chen. « Divide and conquer ». Dans GECCO '20 : Genetic and Evolutionary Computation Conference. New York, NY, USA : ACM, 2020. http://dx.doi.org/10.1145/3377929.3389927.
Texte intégralMcDonnell, Tyler, Sari Andoni, Elmira Bonab, Sheila Cheng, Jun-Hwan Choi, Jimmie Goode, Keith Moore, Gavin Sellers et Jacob Schrum. « Divide and conquer ». Dans GECCO '18 : Genetic and Evolutionary Computation Conference. New York, NY, USA : ACM, 2018. http://dx.doi.org/10.1145/3205455.3205476.
Texte intégralScholz, Ulrich, et Romain Rouvoy. « Divide and conquer ». Dans Ninth international workshop. New York, New York, USA : ACM Press, 2007. http://dx.doi.org/10.1145/1294948.1294958.
Texte intégralDriff, Lydia Nahla, et Habiba Drias. « Divide and Conquer ». Dans the International Conference. New York, New York, USA : ACM Press, 2018. http://dx.doi.org/10.1145/3230905.3230913.
Texte intégralZhang, Zhiwei, Jeffrey Xu Yu, Lu Qin et Zechao Shang. « Divide & ; Conquer ». Dans SIGMOD/PODS'15 : International Conference on Management of Data. New York, NY, USA : ACM, 2015. http://dx.doi.org/10.1145/2723372.2723740.
Texte intégralFlechais, Ivan, Jens Riegelsberger et M. Angela Sasse. « Divide and conquer ». Dans the 2005 workshop. New York, New York, USA : ACM Press, 2005. http://dx.doi.org/10.1145/1146269.1146280.
Texte intégralRapports d'organisations sur le sujet "Cuppen Divide and Conquer"
Coppersmith, Don, Lisa Fleischer, Bruce Hendrickson et Ali Pinar. A divide-and-conquer algorithm for identifying strongly connectedcomponents. Office of Scientific and Technical Information (OSTI), mars 2003. http://dx.doi.org/10.2172/889876.
Texte intégralAinsworth, Paul, et Svetlana Kryukova. A Multimedia Interactive Environment Using Program Archetypes : Divide-and-Conquer. Fort Belvoir, VA : Defense Technical Information Center, janvier 2006. http://dx.doi.org/10.21236/ada443259.
Texte intégralGragg, William, et L. Reichel. A Divide and Conquer Method for Unitary and Orthogonal Eigenproblems. Fort Belvoir, VA : Defense Technical Information Center, février 1989. http://dx.doi.org/10.21236/ada205433.
Texte intégralDel Carpio, Lucia, Samuel Kapon et Sylvain Chassang. Using Divide-and-Conquer to Improve Tax Collection : Evidence from the Field. Cambridge, MA : National Bureau of Economic Research, juillet 2022. http://dx.doi.org/10.3386/w30218.
Texte intégralJessup, E. A case against a divide and conquer approach to the nonsymmetric eigenvalue problem. Office of Scientific and Technical Information (OSTI), décembre 1991. http://dx.doi.org/10.2172/10108206.
Texte intégralGuan, X., et E. C. Uberbacher. A multiple divide-and-conquer (MDC) algorithm for optimal alignments in linear space. Office of Scientific and Technical Information (OSTI), juin 1994. http://dx.doi.org/10.2172/10168027.
Texte intégralJessup, E. A case against a divide and conquer approach to the nonsymmetric eigenvalue problem. Office of Scientific and Technical Information (OSTI), décembre 1991. http://dx.doi.org/10.2172/5926172.
Texte intégralBorges, Carlos F., et William B. Gragg. A Parallel Divide and Conquer Algorithm for the Generalized Real Symmetric Definite Tridiagonal Eigenproblem. Fort Belvoir, VA : Defense Technical Information Center, décembre 1992. http://dx.doi.org/10.21236/ada262297.
Texte intégralTucker, Jon R., et Rudolph J. Magyar. The potential, limitations, and challenges of divide and conquer quantum electronic structure calculations on energetic materials. Office of Scientific and Technical Information (OSTI), février 2012. http://dx.doi.org/10.2172/1038199.
Texte intégral