factorization
P. Carmona-saez, R. Nogales, C. Vicente et al. · 2008
Cited by 0
Search 250 million research papers
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Factorization”
Factorization
Edward Frenkel, Dani Ben‐Zvi · Mathematical surveys and monographs · 2004
Cited by 0
FACTORIZATION
Harvard University Press eBooks · 2025
Cited by 0
Factorization
Jonathan D. H. Smith · 2015
Cited by 0
FACTORIZATION
Paul Lockhart · Harvard University Press eBooks · 2025
Cited by 0
Factorization
Di Phan Reagan · CSUSB ScholarWorks (California State University, San Bernardino) · 2008
The purpose of this thesis will focus on the two most efficient algorithms which are quadratic sieve and number field sieve. Background information such as definitions and theorems are given to help understand the concepts behind each method.
Cited by 0Open access
Factorization
Andreas Maletti, Rule Extraction, Weight Training (em et al. · 2012
Cited by 0
Factorization
Ferretti, Andrea · Graduate studies in mathematics · 2023
Cited by 0
factorization
2013
Cited by 0
Factorization
Hanno Ackermann · 2021
Cited by 0
Factorization
English <tel-v, Hal Id Tel, Marc Joye (cryptographer et al. · 2010
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Département de formation doctorale en informatique École doctorale IAEM Lorraine UFR STMIA Speeding up Integer Multiplication and
Cited by 0
Factorization
Reagan, Di Phan · CSUSB ScholarWorks (California State University, San Bernardino) · 2008
The purpose of this thesis will focus on the two most efficient algorithms which are quadratic sieve and number field sieve. Background information such as definitions and theorems are given to help understand the concepts behind each method.
Cited by 0Open access
Factorization
Lawrence Susanka · Springer undergraduate texts in mathematics and technology · 2025
Cited by 0
Factorization
Hanno Ackermann · 2014
Cited by 0
factorization
Cyril Bouvier · 2013
Cited by 0
factorization
Feng Yuan · 2000
Cited by 0
Factorization
Kevin Costello, Owen Gwilliam · 2015
Cited by 0
X-chain-Factorization: X-chain-Factorization
emmanuelwjy · Zenodo (CERN European Organization for Nuclear Research) · 2015
This is the first version of X-chain Factorization algorithm for graph states.
Cited by 0Open access
M (2004) Temporal factorization vs. spatial factorization
Lihi Zelnik-manor, Michal Irani · 2013
Abstract. The traditional subspace-based approaches to segmentation (often referred to as multi-body factorization approaches) provide spatial clustering/segmentation by grouping together points moving with consistent motions. We are exploring a dual approach to factorization, i.e., obtaining temporal clustering/segmentation by grouping together frames capturing consistent shapes. Temporal cuts are thus detected at non-rigid changes in the shape of the scene/object. In addition it provides a clustering of the frames with consistent shape (but not necessarily same motion). For example, in a sequence showing a face which appears serious at some frames, and is smiling in other frames, all the “serious expression ” frames will be grouped together and separated from all the “smile ” frames which will be classified as a second group, even though the head may meanwhile undergo various random motions. 1
Cited by 0
q-factorization, Maurey's theorem Grothendieck factorization theorem
Laurent Schwartz, Paul R. Chernoff · Lecture notes in mathematics · 1981
Cited by 0