{| class="wikitable" border="1"
{| class="wikitable" border="1"
2 KB (274 words) - 15:59, 18 February 2014
== Week 1 March 7: Introduction ==
### Why TC-1 in addition to TC-0
739 bytes (102 words) - 15:11, 9 June 2014
|content=* C++ Coding Standards* Boost 1* Boost 2* Concurrency 1* Concurrency 2
423 bytes (53 words) - 15:10, 3 February 2020
** {{{1|}}}
12 bytes (0 words) - 11:22, 11 April 2014
sample source 1:
const image2d<int_u8> test1(1,1);
2 KB (258 words) - 15:04, 12 November 2014
** LL(1), LL(k)
** LR(0), SLR(1), LR(1), LALR(1), LR(k)
1 KB (160 words) - 15:44, 4 February 2020
- tc-1 & tc-2 presentation (select-const, default-visitor,
* 03-19: TC-1
1 KB (167 words) - 15:11, 9 June 2014
== 1. Inscription ==
945 bytes (138 words) - 18:19, 20 December 2021
* the [[Epita/CMP1-Course|Compiler Construction Course 1 (CMP1)]],
28/11/2008 : AppIng1 : Atelier C++ jours 1 & 2
2 KB (211 words) - 15:11, 9 June 2014
=== Fig. 1 ===
{| class="wikitable" border="1"
3 KB (497 words) - 15:46, 18 February 2014
Phone: +33 1 53 14 59 22<br/>
Fax: +33 1 53 14 59 22
805 bytes (108 words) - 15:04, 12 November 2014
| title = Total Variation Minimization with L^1 Data Fidelity as a Contrast Invariant Filter
...ect to any change of contrast. First, we show that minimization of <math>L^1+TV</math> yields a self-dual and contrast invariant filter. Then, we furthe
3 KB (429 words) - 19:19, 5 January 2018
| identifier = isbn:978-1-84821-215-2
isbn = <nowiki>{</nowiki>978-1-84821-215-2<nowiki>}</nowiki>,
1 KB (147 words) - 16:21, 5 January 2018
| pages = 1 to 15
pages = <nowiki>{</nowiki>1--15<nowiki>}</nowiki>,
2 KB (205 words) - 09:48, 21 December 2022
=== Step 1 ===
1 KB (209 words) - 15:04, 12 November 2014
== <span style="color:#000080">'''Theme 1: Image processing and pattern recognition'''</span> ==
2 KB (223 words) - 14:52, 17 September 2022
| pages = 1 to 6
pages = <nowiki>{</nowiki>1--6<nowiki>}</nowiki>,
1 KB (139 words) - 18:57, 4 January 2018
...on of a new evaluation protocol for text detection algorithms" at EPITA at 1:30 pm.
243 bytes (33 words) - 15:49, 5 December 2015
...niela]], Admin. || daniela.becker-at-lrde.epita.fr || EPITA Paris || +33 1 53 14 59 22
...Carlinet]], Dr. || edwin.carlinet-at-lrde.epita.fr || EPITA Paris || +33 1 53 14 59 44
6 KB (678 words) - 14:05, 10 March 2022
* the [[Epita/CMP1-Course|Compiler Construction Course 1 (CMP1)]] and
== CMP 1 ==
7 KB (907 words) - 15:11, 9 June 2014
|number=1
214 bytes (34 words) - 15:21, 9 April 2014
* the [[Epita/CMP1-Course|Compiler Construction Course 1 (CMP1)]],
15/12/2008 : Ing1 GrpB : abstract-syntax (sections 1 & 2)
3 KB (372 words) - 15:11, 9 June 2014
...minimum with a <math>1</math>-saddle by dynamics or pairing the same <math>1</math>-saddle with a minimum by persistence leads exactly to the same pairi
equal on $n$-D Morse functions, $n\geq 1$. More exactly,
3 KB (440 words) - 15:54, 2 September 2022
| pages = 1 to 21
pages = <nowiki>{</nowiki>1--21<nowiki>}</nowiki>,
2 KB (214 words) - 15:57, 14 December 2022
...y cell is <math>1</math>, which is the Euler characteristic of an <math>(n-1)</math>-dimensional ball. Working in the particular setting of cubical comp
each boundary cell is $1$, which is the Euler
3 KB (355 words) - 15:32, 16 December 2022
| identifier = isbn:1-4244-0728-1
isbn = <nowiki>{</nowiki>1-4244-0728-1<nowiki>}</nowiki>,
3 KB (329 words) - 18:56, 4 January 2018
...Chargé de recherche CNRS dans l'Equipe Image à l'IMB (Université Bordeaux 1, France
396 bytes (51 words) - 16:13, 6 October 2014
|location=Amphi 1
355 bytes (41 words) - 16:35, 20 May 2015
* The CSI seminar on 1 July 2016 where each of the lab's student presents his/her research done ov
342 bytes (54 words) - 17:59, 29 June 2016
| identifier = isbn:1-4244-0695-1
isbn = <nowiki>{</nowiki>1-4244-0695-1<nowiki>}</nowiki>,
3 KB (346 words) - 12:15, 26 April 2016
|content=1. Architectures massivement parallèles
3. Patrons de programmation efficace (Part 1: Memory consideration)
1 KB (213 words) - 15:36, 4 February 2020
|location=Amphi 1
649 bytes (70 words) - 18:14, 30 January 2020
list_print (list_new (2, list_new (1, list_new (0, NULL))),
## ASN.1
3 KB (425 words) - 15:11, 9 June 2014
| chapter = 1
| identifier = doi:10.4018/978-1-4666-2092-6.ch001
3 KB (436 words) - 16:51, 18 June 2019
...ackle these issues, this work enriches D. Knuth's trie structure, avoiding 1) the need to access the database to sample since patterns are drawn directl
| pages = 1 to 10
3 KB (426 words) - 16:55, 14 December 2022
|content=* Cours 1: Introduction, Décrire et reconnaître un motif (1/2) : Classification simple avec apprentissage supervisé ou non (KNN, SVM,
* TP 1 (2 heures) : Détecter un motif – Où est Charlie ?
3 KB (493 words) - 16:10, 4 February 2020
| location = Amphi 1
...le sens où les qubits (bits quantiques) peuvent valoir simultanément 0 et 1. Afin de pouvoir appréhender cette technologie, nous rappellerons ce que s
2 KB (344 words) - 21:49, 29 January 2020
{{DISPLAYTITLE:Vaucanson 1.3.9 (July 8th, 2011)}}
** [{{SERVER}}/dload/vaucanson/1.3.9/vaucanson-1.3.9.tar.gz vaucanson-1.3.9.tar.gz]
2 KB (232 words) - 17:38, 6 November 2014
[[Epita/CMP1-Course|Compiler Construction Course 1]] and
{{DISPLAYTITLE:CCMP 1}}
9 KB (1,168 words) - 15:11, 9 June 2014
.../tt> entries. If the environment variable <tt>PRCS_LOGQUERY</tt> is set to 1, prcs will ask for this at checkin-time.
716 bytes (104 words) - 15:04, 12 November 2014
| number = 1
| pages = 1 to 36
4 KB (492 words) - 10:46, 3 April 2023
== Week 1 January 19, Main.RobertAnisko: Program generators, Introduction to Gperf, F
cat >1-if.y <<-EOF
5 KB (693 words) - 15:11, 9 June 2014
...s langages rationnels* TPs (3 * 2h)** Expressions rationnelles** Vaucanson 1/2** Vaucanson 2/2
814 bytes (95 words) - 15:16, 3 February 2020
...t is, when the boundary of its continuous analog is a topological <math>(n-1)</math>-manifold, then it is digitally well-composed (DWC)which means that
$(n-1)$-manifold, then it is digitally well-composed (DWC),
2 KB (308 words) - 15:32, 16 December 2022
| lrdepaper = http://www.lrde.epita.fr/dload/papers/verna.13.tug-1.pdf
| id = verna.13.tug-1
2 KB (297 words) - 10:40, 22 April 2023
[[Epita/CMP1-Course|Compiler Construction Course 1]] and
{{DISPLAYTITLE:CMP 1}}
10 KB (1,308 words) - 15:11, 9 June 2014
...on a normal pseudomanifold of dimension <math>d</math>, is a pure <math>(d-1)</math>-subcomplex that satisfies a drop-of-water principle. In this paper,
$(d-1)$-subcomplex that satisfies a drop-of-water
2 KB (298 words) - 16:50, 4 July 2023
| pages = 03:1 to 03:16
pages = <nowiki>{</nowiki>03:1-03:16<nowiki>}</nowiki>
2 KB (284 words) - 15:45, 8 December 2022
bibliothèque IOD (1). Nous verrons ensuite comment Silicon (2), un jeune
| urls = (1) https://github.com/matt-42/iod,(2) https://github.com/matt-42/silicon
2 KB (261 words) - 15:06, 10 May 2016
...ithm. We also study the special case when the fidelity term is the <math>L^1</math>-norm. Finally we provide some experiments.
term is the $L^1$-norm. Finally we provide some
2 KB (313 words) - 19:19, 5 January 2018
