nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Deep Convolutional Neural Network based Chinese Menu Recognition App
|
Lee, Ming Che |
|
2017 |
128 |
C |
p. 14-20 |
artikel |
2 |
CAPTCHA-based image annotation
|
Kwon, Shinil |
|
2017 |
128 |
C |
p. 27-31 |
artikel |
3 |
3-colouring for dually chordal graphs and generalisations
|
Leitert, Arne |
|
2017 |
128 |
C |
p. 21-26 |
artikel |
4 |
Construct a perfect word hash function in time independent of the size of integers
|
Han, Yijie |
|
2017 |
128 |
C |
p. 5-10 |
artikel |
5 |
Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczúr and Frank
|
Bernáth, Attila |
|
2017 |
128 |
C |
p. 49-53 |
artikel |
6 |
Directed hypergraphs and Horn minimization
|
Bérczi, Kristóf |
|
2017 |
128 |
C |
p. 32-37 |
artikel |
7 |
Discrete Logarithm and Minimum Circuit Size
|
Rudow, M. |
|
2017 |
128 |
C |
p. 1-4 |
artikel |
8 |
Editorial Board
|
|
|
2017 |
128 |
C |
p. IFC |
artikel |
9 |
Extension complexities of Cartesian products involving a pyramid
|
Tiwary, Hans Raj |
|
2017 |
128 |
C |
p. 11-13 |
artikel |
10 |
New insights on GA-H reduced graphs
|
Gavril, Fanica |
|
2017 |
128 |
C |
p. 58-61 |
artikel |
11 |
Privacy risks ensuing from cross-matching among databases: A case study for soft biometrics
|
Sadhya, Debanjan |
|
2017 |
128 |
C |
p. 38-45 |
artikel |
12 |
2-subcoloring is NP-complete for planar comparability graphs
|
Ochem, Pascal |
|
2017 |
128 |
C |
p. 46-48 |
artikel |
13 |
Two strings at Hamming distance 1 cannot be both quasiperiodic
|
Amir, Amihood |
|
2017 |
128 |
C |
p. 54-57 |
artikel |