binarize < binary < binaural

Facettes : Author.f AffPays.f AffRegion.f AffVille.f AffOrg.f KwdFr.f Mesh.f MeshFr.f Teeft.f

List of bibliographic references indexed by binary

Number of relevant bibliographic references: 57.
[20-40] [0 - 20][0 - 50][40-56][40-60]

Ident.	Authors (with country if any)	Title
006C64 (2004)	Damien Stehlé [France] ; Paul Zimmermann [France]	A Binary Recursive Gcd Algorithm
007128 (2004)	Damien Stehlé [France] ; Paul Zimmermann [France]	A Binary Recursive Gcd Algorithm
007230 (2003-06-29)	Daniel Augot [France] ; Magali Bardet [France] ; Jean-Charles Faugère [France]	Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Grobner bases
007445 (2003)	Gregory Kucherov [France] ; Pascal Ochem ; Michael Rao [France]	How many square occurrences must a binary sequence contain?
007562 (2003)	Alexander Bockmayr ; Vladimir Lunin ; Alexandre Urzhumtsev	A binary integer programming approach for the determination of structures of biological macromolecules
007647 (2003)	Salvatore Tabbone ; Laurent Wendling	Binary shape normalization using the Radon transform
007664 (2003)	Daniel Augot ; Magali Bardet ; Jean-Charles Faugère	Efficient decoding of (binary) the correction capacity of the code using Gröbner bases
007856 (2003)	Gregory Kucherov ; Pascal Ochem ; Michael Rao	How many square occurrences must a binary sequence contain?
007A92 (2003)	Salvatore Tabbone [France] ; Laurent Wendling [France]	Binary Shape Normalization Using the Radon Transform
007E58 (2003)	Salvatore Tabbone [France] ; Laurent Wendling [France]	Binary shape normalization using the Radon transform
007E91 (2003)	Alexander Bockmayr [France] ; Vladimir Y. Lunin ; Alexandre Urzhumtsev	A binary integer programming approach for the determination of structures of biological macromolecules
008402 (2002)	Daniel Augot ; Magali Bardet ; Jean-Charles Faugere	Efficient Decoding of (binary) Cyclic Codes beyond the correction capacity of the code using Gröbner bases
008457 (2002)	Vladimir Y. Lunin ; Alexandre Urzhumtsev ; Alexander Bockmayr	Direct phasing by binary integer programming
008468 (2002)	Vladimir Y. Lunin ; Alexandre Urzhumtsev ; Alexander Bockmayr	Binary integer programming and its use for envelope determination
008655 (2002)	Gregory Kucherov ; Pascal Ochem ; Michael Rao	How many square occurrences must a binary sequence contain
008916 (2002)	Vladimir Y. Lunin [Russie, France] ; Alexandre Urzhumtsev [France] ; Alexander Bockmayr [France]	Direct phasing by binary integer programming
008B31 (2002)	Gregory Kucherov [France] ; Pascal Ochem [France] ; Michael Rao [France]	How many square occurrences must a binary sequence contain
008B49 (2002)	Daniel Augot [France] ; Magali Bardet [France] ; Jean-Charles Faugère [France]	Efficient Decoding of (binary) Cyclic Codes beyond the correction capacity of the code using Gröbner bases
008B52 (2002)	Vladimir Y. Lunin ; Alexandre Urzhumtsev ; Alexander Bockmayr [France]	Direct phasing by binary integer programming
008B76 (2002)	Vladimir Y. Lunin ; Alexandre Urzhumtsev ; Alexander Bockmayr [France]	Binary integer programming and its use for envelope determination
008C14 (2002)	Damien Stehlé [France] ; Paul Zimmermann [France]	A Binary Recursive Gcd Algorithm

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i -k "binary" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i  \
                -Sk "binary" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Title.i
   |clé=    binary
}}

---

This area was generated with Dilib version V0.6.33. Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022