Search results for "GCD"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
122	S. Unnikrishna Pillai, Ben Liang 0001	Two-Dimensional Blind Deconvolution Using a Robust GCD Approach.	ICIP (1)	1997	DBLP DOI BibTeX RDF	2D blind deconvolution, robust GCD approach, blind image deconvolution, two-dimensional polynomials, distorted images, FIR distortion filters, co-prime filters, 1D Sylvester-type GCD algorithms, support size, synthetically blurred images, real motion-blurred pictures, lD interpolation, discrete Fourier transform, experimental results, noisy images, noise robustness, deconvolution, greatest common divisor, deblurring, z-transforms, computational complexity reduction
114	Akira Terui	An iterative method for calculating approximate GCD of univariate polynomials.	ISSAC	2009	DBLP DOI BibTeX RDF	approximate polynomial gcd, gradient-projection method, optimization, ill-conditioned problem
114	George Havas, Jean-Pierre Seifert	The Complexity of the Extended GCD Problem.	MFCS	1999	DBLP DOI BibTeX RDF	computational problems of diophantine equations, extended gcd computations, Approximation algorithms, NP-hardness, probabilistically checkable proofs, interactive proof systems
93	Saurabh Agarwal, Gudmund Skovbjerg Frandsen	Binary GCD Like Algorithms for Some Complex Quadratic Rings.	ANTS	2004	DBLP DOI BibTeX RDF
87	K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal	Lower Bounds for Group Covering Designs.	AAECC	1999	DBLP DOI BibTeX RDF
78	Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi	Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials.	ISSAC	2006	DBLP DOI BibTeX RDF	approximate multiple root, approximate polynomial gcd, multivariate polynomial gcd, singular polynomial, linear constraint, symbolic/numeric hybrid method
78	Kenneth Weber	The Accelerated Integer GCD Algorithm.	ACM Trans. Math. Softw.	1995	DBLP DOI BibTeX RDF	integer greatest common divisor, number-theoretic computations, GCD
69	Jennifer de Kleine, Michael B. Monagan, Allan D. Wittkopf	Algorithms for the non-monic case of the sparse modular GCD algorithm.	ISSAC	2005	DBLP DOI BibTeX RDF	Zippel's algorithm, polynomial greatest common divisors, sparse multivariate polynomials, probabilistic algorithms, modular algorithms
69	Joachim von zur Gathen, Igor E. Shparlinski	GCD of Random Linear Forms.	ISAAC	2004	DBLP DOI BibTeX RDF
69	Mark van Hoeij, Michael B. Monagan	Algorithms for polynomial GCD computation over algebraic function fields.	ISSAC	2004	DBLP DOI BibTeX RDF	modular algorithms
69	Mark van Hoeij, Michael B. Monagan	A modular GCD algorithm over number fields presented with multiple extensions.	ISSAC	2002	DBLP DOI BibTeX RDF
69	S. Unnikrishna Pillai, Ben Liang 0001	Blind image deconvolution using a robust GCD approach.	IEEE Trans. Image Process.	1999	DBLP DOI BibTeX RDF
69	Mohamed Omar Rayes, Paul S. Wang, Kenneth Weber	Parallelization of the Sparse Modular GCD Algorithm for Multivariate Polynomials on Shared Memory Multiprocessors.	ISSAC	1994	DBLP DOI BibTeX RDF
69	Lars Langemyr	An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal GCD's over an Algebraic Number Field.	AAECC	1990	DBLP DOI BibTeX RDF
65	Saurabh Agarwal, Gudmund Skovbjerg Frandsen	A New GCD Algorithm for Quadratic Number Rings with Unique Factorization.	LATIN	2006	DBLP DOI BibTeX RDF	quadratic number ring, quadratic form reduction, gcd
64	Abdulah Abdulah Zadeh	High Speed Modular Divider Based on GCD Algorithm.	ICICS	2007	DBLP DOI BibTeX RDF	GCD algorithm, Radix four, Finite Field, ECC
64	Seyed Mohammad Mahdi Javadi, Michael B. Monagan	A sparse modular GCD algorithm for polynomials over algebraic function fields.	ISSAC	2007	DBLP DOI BibTeX RDF	GCD algorithms, sparse interpolation, algebraic function fields
64	Dario Andrea Bini, Paola Boito	Structured matrix-based methods for polynomial in-gcd: analysis and comparisons.	ISSAC	2007	DBLP DOI BibTeX RDF	bézout matrix, cauchy matrices, displacement structure, polynomial gcd, sylvester matrix
64	Marc Joye, Pascal Paillier	GCD-Free Algorithms for Computing Modular Inverses.	CHES	2003	DBLP DOI BibTeX RDF	RSA key generation, GCD algorithms, embedded software, efficient implementations, prime numbers, Modular inverses
64	Marc Moreno Maza, Renaud Rioboo	Polynomial Gcd Computations over Towers of Algebraic Extensions.	AAECC	1995	DBLP DOI BibTeX RDF	Polynomial gcd, zero dimensional systems, AXIOM, triangular sets, algebraic numbers, subresultants
56	Pramook Khungurn, Hiroshi Sekigawa, Kiyoshi Shirayanagi	Minimum converging precision of the QR-factorization algorithm for real polynomial GCD.	ISSAC	2007	DBLP DOI BibTeX RDF	algebraic algorithm stabilization, polynomial greatest common divisor
56	Joachim von zur Gathen, Igor E. Shparlinski	GCD of Random Linear Combinations.	Algorithmica	2006	DBLP DOI BibTeX RDF
56	Giovanni Cesari	Parallel Implementation of Schönhage's Integer GCD Algorithm.	ANTS	1998	DBLP DOI BibTeX RDF
53	Joachim von zur Gathen, Igor E. Shparlinski	Approximate Polynomial gcd: Small Degree and Small Height Perturbations.	LATIN	2008	DBLP DOI BibTeX RDF	Euclidean algorithm, gcd, approximate computation
52	Daniel Lichtblau	Half-GCD and fast rational recovery.	ISSAC	2005	DBLP DOI BibTeX RDF	integer gcd, rational recovery, subquadratic arithmetic
49	Yueming Wang, Gang Pan 0001, Zhaohui Wu 0001	3D Face Recognition in the Presence of Expression: A Guidance-based Constraint Deformation Approach.	CVPR	2007	DBLP DOI BibTeX RDF
49	Erich L. Kaltofen, Lihong Zhi	Hybrid symbolic-numeric computation.	ISSAC	2006	DBLP DOI BibTeX RDF	symbolic/numeric hybrid methods
46	Tudor Jebelean	Design of a systolic coprocessor for rational addition.	ASAP	1995	DBLP DOI BibTeX RDF	systolic coprocessor, rational addition, exact division, field programmable gate arrays, parallel architectures, systolic arrays, digital arithmetic, multiplication, addition, subtraction, rational numbers, GCD
45	Chang Hoon Kim, Soonhak Kwon, Jong Jin Kim, Chun Pyo Hong	A Compact and Fast Division Architecture for a Finite Field.	ICCSA (1)	2003	DBLP DOI BibTeX RDF	Extended Binary GCD, VLSI, Finite Field, Division
45	Kleanthis Psarris, Santosh Pande	Classical dependence analysis techniques: sufficiently accurate in practice.	HICSS (2)	1995	DBLP DOI BibTeX RDF	GCD test, Banerjee-Wolfe test, statement data dependence, automatic loop parallelization, Perfect benchmarks, exact test, program testing, data analysis, accuracy, parallelizing compilers, program diagnostics, sufficient conditions, program control structures, parallelising compilers, data dependence analysis, greatest common divisor, automatic vectorization
44	Zhonggang Zeng, Barry H. Dayton	The approximate GCD of inexact polynomials.	ISSAC	2004	DBLP DOI BibTeX RDF	squarefree, polynomial, factorization, greatest common divisor
44	Ivan Damgård, Gudmund Skovbjerg Frandsen	Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers.	FCT	2003	DBLP DOI BibTeX RDF
44	Sidi Mohamed Sedjelmaci	On a parallel Lehmer-Euclid GCD algorithm.	ISSAC	2001	DBLP DOI BibTeX RDF
41	Shuhong Gao, Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi	Approximate factorization of multivariate polynomials via differential equations.	ISSAC	2004	DBLP DOI BibTeX RDF	approximate gcd, multivariate gcd, multivariate polynomial factorization, symbolic numeric hybrid method, singular value decomposition, approximate factorization
39	David Shallcross, Victor Y. Pan, Yu Lin-Kriz	The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD	FOCS	1993	DBLP DOI BibTeX RDF	NC equivalence, planar integer linear programming, Euclidean GCD, NC-reduction, remainder sequence, positive integers, Euclidean algorithm, P-completeness
38	Ahmet Ipek	Upper bounds for the condition numbers of the GCD and the reciprocal GCD matrices in spectral norm.	Comput. Math. Appl.	2012	DBLP DOI BibTeX RDF
38	Weiduan Feng, Shaofang Hong, Jianrong Zhao	Divisibility properties of power LCM matrices by power GCD matrices on gcd-closed sets.	Discret. Math.	2009	DBLP DOI BibTeX RDF
38	André Weilert	(1+i)-ary GCD Computation in Z[i] as an Analogue to the Binary GCD Algorithm.	J. Symb. Comput.	2000	DBLP DOI BibTeX RDF
38	Rachid Bouraoui	Calcul sur les grands nombres et VLSI : application au PGCD, au PGCD étendu et à la distance euclidienne. (Very large integer arithmetic in VLSI and its application to the gcd, entended gcd and euclidean distance algorithms).		1993	RDF
38	Alain Guyot	OCAPI: architecture of a VLSI coprocessor for the GCD and the extended GCD of large numbers.	IEEE Symposium on Computer Arithmetic	1991	DBLP DOI BibTeX RDF
38	Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet	GCDHEU: Heuristic Polynomial GCD Algorithm Based On Integer GCD Computation.	J. Symb. Comput.	1989	DBLP DOI BibTeX RDF
38	Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet	GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation.	EUROSAM	1984	DBLP DOI BibTeX RDF
37	Loïck Lhote, Brigitte Vallée	Gaussian Laws for the Main Parameters of the Euclid Algorithms.	Algorithmica	2008	DBLP DOI BibTeX RDF	Euclid’s algorithms, Distributional analysis, Transfer operator, Asymptotic Gaussian laws, Tauberian theorems, Perron’s formula, Dynamical analysis of algorithms, Dynamical systems, Analysis of algorithms, Average-case analysis
37	Doreen Hertel, Alexander Pott	Two results on maximum nonlinear functions.	Des. Codes Cryptogr.	2008	DBLP DOI BibTeX RDF	05B25, AMS Classifications 05B10
37	Keyvan Zarifi, Alex B. Gershman	Generalized Correlation Decomposition-Based Blind Channel Estimation in DS-CDMA Systems With Unknown Wide-Sense Stationary Noise.	IEEE Trans. Signal Process.	2008	DBLP DOI BibTeX RDF
37	Khoongming Khoo, Guang Gong, Douglas R. Stinson	A New Characterization of Semi-bent and Bent Functions on Finite Fields*.	Des. Codes Cryptogr.	2006	DBLP DOI BibTeX RDF	AMS Classification 11T71
37	Howard Cheng, George Labahn	On computing polynomial GCDs in alternate bases.	ISSAC	2006	DBLP DOI BibTeX RDF	Krylov matrices, fraction-free arithmetic, orthogonal polynomials, euclidean algorithm, subresultants
37	Hui Li 0002, Brian Williams 0001	Generalized Conflict Learning for Hybrid Discrete/Linear Optimization.	CP	2005	DBLP DOI BibTeX RDF
37	Michael B. Monagan, Allan D. Wittkopf	On the design and implementation of Brown's algorithm over the integers and number fields.	ISSAC	2000	DBLP DOI BibTeX RDF
37	Mark J. Encarnación	On a Modular Algorithm for Computing GCDs of Polynomials over Algebraic Number Fields.	ISSAC	1994	DBLP DOI BibTeX RDF
34	Xiangyun Kong, David Klappholz, Kleanthis Psarris	The I Test: An Improved Dependence Test for Automatic Parallelization and Vectorization.	IEEE Trans. Parallel Distributed Syst.	1991	DBLP DOI BibTeX RDF	I test, subscript dependence test, Banerjee tests, parallel programming, program testing, program compilers, vectorization, automatic parallelization, loops, loop iterations, GCD
33	Masaru Sanuki, Tateaki Sasaki	Computing Approximate GCDs in Ill-conditioned Cases.	SNC	2007	DBLP DOI BibTeX RDF	approximate GCD, stabilization, euclidean algorithm, ill-conditioned problem
33	Kleanthis Psarris, Xiangyun Kong, David Klappholz	The Direction Vector I Test.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	direction vector I test, data dependence tests, Banerjee test, arbitrary direction vector, GCD test, parallelism detection, parallel programming, parallelization, algorithm theory
31	Laura Ruff, Tudor Jebelean	Functional-Based Synthesis of a Systolic Array for GCD Computation.	IFL	2006	DBLP DOI BibTeX RDF
31	Damien Stehlé, Paul Zimmermann	A Binary Recursive Gcd Algorithm.	ANTS	2004	DBLP DOI BibTeX RDF
31	Andreas Maletti	Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids.	CIAA	2004	DBLP DOI BibTeX RDF
31	Xukai Zou, Byrav Ramamurthy, Spyros S. Magliveras	A GCD attack resistant CRTHACS for secure group communications.	ITCC (2)	2004	DBLP DOI BibTeX RDF
31	Bogdan Matasaru, Tudor Jebelean	FPGA Implementation of an Extended Binary GCD Algorithm for Systolic Reduction of Rational Numbers.	FPL	2000	DBLP DOI BibTeX RDF
31	Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas	GCD of Many Integers.	COCOON	1999	DBLP DOI BibTeX RDF
31	Tudor Jebelean	Systolic Algorithms for Long Integer GCD Computation.	CONPAR	1994	DBLP DOI BibTeX RDF
31	Tudor Jebelean	Comparing several GCD algorithms.	IEEE Symposium on Computer Arithmetic	1993	DBLP DOI BibTeX RDF
31	Jean-Louis Roch, Gilles Villard	Parallel gcd and Lattice Basis Reduction.	CONPAR	1992	DBLP DOI BibTeX RDF
25	Keyvan Zarifi, Alex B. Gershman	Blind channel estimation in DS-CDMA systems with unknown wide-sense stationary noise using generalized correlation decomposition.	ICASSP	2008	DBLP DOI BibTeX RDF
25	Rafael E. Carrillo, Tuncer C. Aysal, Kenneth E. Barner	Generalized cauchy distribution based robust estimation.	ICASSP	2008	DBLP DOI BibTeX RDF
25	Xiangyong Zeng, Nian Li, Lei Hu	A Class of Nonbinary Codes and Sequence Families.	SETA	2008	DBLP DOI BibTeX RDF	correlation distribution, Linear code, exponential sum, quadratic form, weight distribution
25	Kazuhiro Yokoyama	On systems of algebraic equations with parametric exponents II.	Appl. Algebra Eng. Commun. Comput.	2007	DBLP DOI BibTeX RDF	Ideals with parametric exponents, Gröbner basis
25	Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro	Rendezvous and Election of Mobile Agents: Impact of Sense of Direction.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
25	Xiangyong Zeng, John Q. Liu, Lei Hu	Generalized Kasami Sequences: The Large Set.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
25	Dongxia Sun, Lihong Zhi	Structured Low Rank Approximation of a Bezout Matrix.	Math. Comput. Sci.	2007	DBLP DOI BibTeX RDF	Bezout matrix, approximate greatest common divisor, structured nonlinear total least squares, symbolic/numeric hybrid method
25	Marc Moreno Maza, Yuzhen Xie	Component-level parallelization of triangular decompositions.	PASCO	2007	DBLP DOI BibTeX RDF	component-level, parallelization, triangular decompositions, polynomial system solving
25	Fabrizio Caruso	The SARAG Library: Some Algorithms in Real Algebraic Geometry.	ICMS	2006	DBLP DOI BibTeX RDF
25	Gene Tsudik, Shouhuai Xu	A Flexible Framework for Secret Handshakes.	Privacy Enhancing Technologies	2006	DBLP DOI BibTeX RDF
25	Loïck Lhote, Brigitte Vallée	Sharp Estimates for the Main Parameters of the Euclid Algorithm.	LATIN	2006	DBLP DOI BibTeX RDF
25	Sara Khodadad, Michael B. Monagan	Fast rational function reconstruction.	ISSAC	2006	DBLP DOI BibTeX RDF	fast Euclidean algorithm, rational reconstruction, modular algorithms
25	Patricio Bulic, Veselko Gustin	An efficient way to filter out data dependences with a sufficiently large distance between memory references.	ACM SIGPLAN Notices	2005	DBLP DOI BibTeX RDF	SIMD microprocessors, vectorizing compilers, data dependence analysis
25	Patricio Bulic, Veselko Gustin	Fast Dependence Analysis in a Multimedia Vectorizing Compiler.	PDP	2004	DBLP DOI BibTeX RDF
25	Glauber Cintra, Yoshiko Wakabayashi	Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems.	WEA	2004	DBLP DOI BibTeX RDF
25	Patricio Bulic, Veselko Gustin	On Dependence Analysis for SIMD Enhanced Processors.	VECPAR	2004	DBLP DOI BibTeX RDF
25	Patricio Bulic, Veselko Gustin	Data Dependence Analysis for Intra-Register Vectorization.	ISPDC	2003	DBLP DOI BibTeX RDF
25	Hanno Lefmann	Sparse Parity-Check Matrices over Finite Fields (Extended Abstract).	COCOON	2003	DBLP DOI BibTeX RDF
25	Nigel Boston, T. Charles Clancy, Y. Liow, Jonathan E. Webster	Genus Two Hyperelliptic Curve Coprocessor.	CHES	2002	DBLP DOI BibTeX RDF
25	Erich L. Kaltofen	An output-sensitive variant of the baby steps/giant steps determinant algorithm.	ISSAC	2002	DBLP DOI BibTeX RDF
25	Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang	Variations on a Theorem of Fine & Wilf.	MFCS	2001	DBLP DOI BibTeX RDF
25	Sidi Mohamed Sedjelmaci	On a Parallel Extended Euclidean Algorithm.	AICCSA	2001	DBLP DOI BibTeX RDF
25	Nicos Karcanias, Marilena Mitrouli	Numerical Computation of the Least Common Multiple of a Set of Polynomials.	Reliab. Comput.	2000	DBLP DOI BibTeX RDF
25	Hiroshi Kai, Matu-Tarow Noda	Hybrid Rational Function Approximation and Its Accuracy Analysis.	Reliab. Comput.	2000	DBLP DOI BibTeX RDF
25	Kuei-Ping Shih, Jang-Ping Sheu, Chih-Yung Chang	Efficient Address Generation for Affine Subscripts in Data-Parallel Programs.	J. Supercomput.	2000	DBLP DOI BibTeX RDF	affine subscripts, multiple induction variables (MIVs), data distribution, distributed-memory multicomputers, single program multiple data (SPMD), data-parallel languages, address generation
25	Ching-Hsien Hsu, Sheng-Wen Bai, Yeh-Ching Chung, Chu-Sing Yang	A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	generalized basic-cycle calculation method, distributed memory multicomputers, Redistribution
25	Mihaly Agfalvi, Istvan Kadar, Erik Papp	Generalization of Pick's theorem for surface of polyhedra.	APL	1999	DBLP DOI BibTeX RDF	APL
25	James L. Massey, Shirlei Serconek	Linear Complexity of Periodic Sequences: A General Theory.	CRYPTO	1996	DBLP DOI BibTeX RDF	Games-Chan algorithm, Hadamard product, Hasse derivative, hyperderivative, stream ciphers, Discrete Fourier transform, DFT, linear complexity
25	Kwang-Hui Lee	A group communication protocol architecture for distributed network management systems.	ICCCN	1995	DBLP DOI BibTeX RDF	group communication protocol architecture, distributed network management systems, managed object view interface, protocol overhead reduction, distributed group management, hierarchical group management, local group manager, group communication daemon, overlapped grouping facility, global group manager, hierarchical domain approach, distributed processing
25	Nader H. Bshouty	On the Complexity of Functions for Random Access Machines.	J. ACM	1993	DBLP DOI BibTeX RDF	indirect addressing, sorting, greatest common divisor, random access machine
25	Tudor Jebelean	Improving the Multiprecision Euclidian Algorithm.	DISCO	1993	DBLP DOI BibTeX RDF
25	Kleanthis Psarris	On exact data dependence analysis.	ICS	1992	DBLP DOI BibTeX RDF
25	Yishay Mansour, Baruch Schieber, Prasoon Tiwari	A Lower Bound for Integer Greatest Common Divisor Computations.	J. ACM	1991	DBLP DOI BibTeX RDF	floor operation, greatest common devisor, mod operation, lower bound, truncation
25	Nader H. Bshouty	Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains.	ICCI	1991	DBLP DOI BibTeX RDF
21	Bin Li, Jiawang Nie, Lihong Zhi	Approximate GCDs of polynomials and SOS relaxation.	SNC	2007	DBLP DOI BibTeX RDF	SOS relaxation, global minimization, GCD
21	François Boulier, François Lemaire, Marc Moreno Maza	PARDI!.	ISSAC	2001	DBLP DOI BibTeX RDF	change of rankings, PDE, differential algebra, characteristic sets, gcd
21	Eric Allender, Michael E. Saks, Igor E. Shparlinski	A Lower Bound for Primality.	CCC	1999	DBLP DOI BibTeX RDF	Circuit Complexity Lower Bounds, Primality, Square-Free Numbers, GCD
20	Xin Li 0009, Marc Moreno Maza, Wei Pan 0001	Computations modulo regular chains.	ISSAC	2009	DBLP DOI BibTeX RDF	fast polynomial arithmetic, regular chain, regular gcd, polynomial systems, triangular decomposition, subresultants