Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Muhammad F. I. Chowdhury"'
Autor:
Vincent Neiger, Muhammad F. I. Chowdhury, Gilles Villard, Claude-Pierre Jeannerod, Éric Schost
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, 2015, pp.2370-2387. ⟨10.1109/TIT.2015.2416068⟩
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2015, pp.2370-2387. ⟨10.1109/TIT.2015.2416068⟩
IEEE Transactions on Information Theory, 2015, pp.2370-2387. ⟨10.1109/TIT.2015.2416068⟩
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2015, pp.2370-2387. ⟨10.1109/TIT.2015.2416068⟩
The interpolation step in the Guruswami-Sudan algorithm is a bivariate interpolation problem with multiplicities commonly solved in the literature using either structured linear algebra or basis reduction of polynomial lattices. This problem has been
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf2e363dc4d7039ad73bc7555514f65a
http://arxiv.org/abs/1402.0643
http://arxiv.org/abs/1402.0643
Publikováno v:
ISSAC '12: 37th International Symposium on Symbolic and Algebraic Computation
ISSAC '12: 37th International Symposium on Symbolic and Algebraic Computation, Jul 2012, Grenoble, France. pp.107-114
ISSAC
ISSAC '12: 37th International Symposium on Symbolic and Algebraic Computation, Jul 2012, Grenoble, France. pp.107-114
ISSAC
We provide algorithms computing power series solutions of a large class of differential or $q$-differential equations or systems. Their number of arithmetic operations grows linearly with the precision, up to logarithmic terms.
Final version to
Final version to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a2d246147d53e449f93cf09ede74212
http://arxiv.org/abs/1205.3414
http://arxiv.org/abs/1205.3414
Publikováno v:
ISSAC 2012-37th International Symposium on Symbolic and Algebraic Computation
ISSAC 2012-37th International Symposium on Symbolic and Algebraic Computation, Jul 2012, Grenoble, France. pp.99-106
ISSAC 2012-37th International Symposium on Symbolic and Algebraic Computation, Jul 2012, Grenoble, France. pp.99-106
We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We propose a new a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::893beb6aa5231c9e8fd674d717c29a84
Autor:
Muhammad F. I. Chowdhury, Marc Moreno Maza, Wei Pan, Eric Schost, Ilias Kotsireas, Roderick Melnik, Brian West
Publikováno v:
AIP Conference Proceedings.
Today's parallel hardware architectures and computer memory hierarchies enforce revisiting fundamental algorithms which were often designed with algebraic complexity as the main complexity measure and with sequential running time as the main performa
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, Elsevier, 2011, 46 (12), pp.1378-1402. ⟨10.1016/j.jsc.2011.08.015⟩
Journal of Symbolic Computation, 2011, 46 (12), pp.1378-1402. ⟨10.1016/j.jsc.2011.08.015⟩
Journal of Symbolic Computation, Elsevier, 2011, 46 (12), pp.1378-1402. ⟨10.1016/j.jsc.2011.08.015⟩
Journal of Symbolic Computation, 2011, 46 (12), pp.1378-1402. ⟨10.1016/j.jsc.2011.08.015⟩
International audience; We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li et al. (2007), we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd73383419d6f51b4c52766ff6d25107
https://hal.inria.fr/hal-00819155/file/BoChHoSc11.pdf
https://hal.inria.fr/hal-00819155/file/BoChHoSc11.pdf
Publikováno v:
2009 12th International Conference on Computers and Information Technology.
The multiprocessor task graph scheduling problem has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer. The problem is already being known as one of th
Publikováno v:
SNPD
The selective application of technological and related procedural safeguards is an important responsibility of every organization in providing adequate security to its electronic data systems. Protection of data during transmission or while in storag
Publikováno v:
ACM Communications in Computer Algebra. 45:113-114
Motivatived by Guruswami and Rudra's construction of folded Reed-Solomon codes, we give algorithms to solve functional equations of the form Q(x, f(x), f(x)) = 0, where Q is a trivariate polynomial. We compare two approaches, one based on Newton's it
Publikováno v:
ACM Communications in Computer Algebra. 44:99-100
Today's parallel hardware architectures and computer memory hierarchies enforce revisiting fundamental algorithms which were often designed with algebraic complexity as the main complexity measure and with sequential running time as the main performa