default search action
Jean-Marc Delosme
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j12]Jean-Marc Delosme
:
A Signal Flow Graph Approach to the Resolution of Spherical Triangles Using CORDIC. IEEE Trans. Circuits Syst. I Regul. Pap. 69(12): 5159-5170 (2022)
2010 – 2019
- 2016
- [j11]Thomas Hujsa
On Liveness and Reversibility of Equal-Conflict Petri Nets. Fundam. Informaticae 146(1): 83-119 (2016) - [c21]Youen Lesparre, Alix Munier Kordon, Jean-Marc Delosme:
Evaluation of Synchronous Dataflow Graph Mappings onto Distributed Memory Architectures. DSD 2016: 146-153 - 2015
- [c20]Thomas Hujsa
On the Reversibility of Live Equal-Conflict Petri Nets. Petri Nets 2015: 234-253 - 2014
- [j10]Thomas Hujsa
Polynomial Sufficient Conditions of Well-Behavedness and Home Markings in Subclasses of Weighted Petri Nets. ACM Trans. Embed. Comput. Syst. 13(4s): 141:1-141:25 (2014) - [c19]Thomas Hujsa
On the Reversibility of Well-Behaved Weighted Choice-Free Systems. Petri Nets 2014: 334-353 - [c18]Bruno Bodin
Fast and efficient dataflow graph generation. SCOPES 2014: 40-49 - 2013
- [c17]Jean-Marc Delosme, Thomas Hujsa
Polynomial Sufficient Conditions of Well-Behavedness for Weighted Join-Free and Choice-Free Systems. ACSD 2013: 90-99 - 2010
- [j9]Ishay Goldin, Jean-Marc Delosme, Alfred M. Bruckstein
Vesicles and Amoebae: On Globally Constrained Shape Deformation. J. Math. Imaging Vis. 37(2): 112-131 (2010)
2000 – 2009
- 2008
- [c16]Ishay Goldin, Jean-Marc Delosme, Alfred M. Bruckstein
Vesicles and amoebae: Globally constrained shape evolutions. CVPR Workshops 2008: 1-8 - 2005
- [c15]Benoît Miramond
Design Space Exploration for Dynamically Reconfigurable Architectures. DATE 2005: 366-371 - [c14]Benoît Miramond
Decision guide environment for design space exploration. ETFA 2005 - 2000
- [j8]Oskar Mencer, Luc Séméria, Martin Morf, Jean-Marc Delosme:
Application of Reconfigurable CORDIC Architectures. J. VLSI Signal Process. 24(2-3): 211-221 (2000) - [j7]Shen-Fu Hsiao, Chun-Yi Lau, Jean-Marc Delosme:
Redundant Constant-Factor Implementation of Multi-Dimensional CORDIC and Its Application to Complex SVD. J. VLSI Signal Process. 25(2): 155-166 (2000)
1990 – 1999
- 1996
- [j6]Shen-Fu Hsiao, Jean-Marc Delosme:
Parallel singular value decomposition of complex matrices using multidimensional CORDIC algorithms. IEEE Trans. Signal Process. 44(3): 685-697 (1996) - [c13]Larry S. Davis, Jean-Marc Delosme, Francky Catthoor:
Parallel Image/Video Processing and Computer Arithmetic. Euro-Par, Vol. II 1996: 103-108 - 1995
- [j5]Shen-Fu Hsiao, Jean-Marc Delosme:
Householder CORDIC Algorithms. IEEE Trans. Computers 44(8): 990-1001 (1995) - 1994
- [c12]Shen-Fu Hsiao, Jean-Marc Delosme:
Parallel processing of complex data using quaternion and pseudo-quaternion CORDIC algorithms. ASAP 1994: 324-335 - 1992
- [j4]Yiwan Wong, Jean-Marc Delosme:
Transformation of Broadcass into Propagations in Systolic Algorithms. J. Parallel Distributed Comput. 14(2): 121-145 (1992) - [j3]Yiwan Wong, Jean-Marc Delosme:
Optimization of Computation Time for Systolic Arrays. IEEE Trans. Computers 41(2): 159-177 (1992) - [j2]Jean-Marc Delosme:
Bit-level systolic algorithms for real symmetric and Hermitian eigenvalue problems. J. VLSI Signal Process. 4(1): 69-88 (1992) - [c11]Yiwan Wong, Jean-Marc Delosme:
Space-Optimal Linear Processor Allocation for Systolic Arrays Synthesis. IPPS 1992: 275-282 - 1991
- [c10]Shen-Fu Hsiao, Jean-Marc Delosme:
The CORDIC Householder algorithm. IEEE Symposium on Computer Arithmetic 1991: 256-263 - 1990
- [c9]Jean-Marc Delosme:
Bit-level systolic algorithm for the symmetric eigenvalue problem. ASAP 1990: 770-781
1980 – 1989
- 1989
- [c8]Jean-Marc Delosme, Ilse C. F. Ipsen:
Parallel Computation of Algorithms with Uniform Dependences. PP 1989: 319-325 - 1988
- [c7]Jimmy Lam, Jean-Marc Delosme:
Performance of a New Annealing Schedule. DAC 1988: 306-311 - [c6]Jimmy Lam, Jean-Marc Delosme:
Simulated annealing: a fast heuristic for some generic layout problems. ICCAD 1988: 510-513 - 1983
- [c5]Jean-Marc Delosme:
VLSI implementation of rotations in pseudo-Euclidean spaces. ICASSP 1983: 927-930 - [c4]Martin Morf, Ping Ang, Jean-Marc Delosme:
Development of signal processing algorithms via functional programming. ICASSP 1983: 1176-1179 - 1982
- [j1]Hassan M. Ahmed, Jean-Marc Delosme, Martin Morf:
Highly Concurrent Computing Structures for Matrix Arithmetic and Signal Processing. Computer 15(1): 65-82 (1982) - [c3]Martin Morf, Carlos H. Muravchik, Ping Ang, Jean-Marc Delosme:
Fast Cholesky algorithms and adaptive feedback filters. ICASSP 1982: 1727-1731 - [c2]Jean-Marc Delosme, Martin Morf:
Constant-gain filters for finite shift-rank processes. ICASSP 1982: 1732-1735 - 1980
- [c1]Jean-Marc Delosme, Martin Morf, Benjamin Friedlander:
Source location from time differences of arrival: Identifiability and estimation. ICASSP 1980: 818-824
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: