Difference between revisions of "Walter Kosters"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 4: | Line 4: | ||
'''Walter A. Kosters''',<br/> | '''Walter A. Kosters''',<br/> | ||
| − | a Dutch computer scientist and mathematician, and associate professor of CS at LIACS, the Leiden Institute of Advanced Computer Science at [[Leiden University]]. His research interests include [[Neural Networks|neural networks]], [[Genetic Programming#GeneticAlgorithm|genetic algorithms]], [https://en.wikipedia.org/wiki/Analysis_of_algorithms analysis of algorithms], [https://en.wikipedia.org/wiki/Concrete_Mathematics concrete mathematics], [https://en.wikipedia.org/wiki/NP-complete NP-completeness], [https://en.wikipedia.org/wiki/Bioinformatics bioinformatics], [https://en.wikipedia.org/wiki/Data_mining data mining] and [[Artificial Intelligence|artificial intelligence]]. Along with [[Hendrik Jan Hoogeboom]] et al., Walter Kosters works on the [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] of [https://en.wikipedia.org/wiki/Tetris Tetris] <ref>[ | + | a Dutch computer scientist and mathematician, and associate professor of CS at LIACS, the Leiden Institute of Advanced Computer Science at [[Leiden University]]. His research interests include [[Neural Networks|neural networks]], [[Genetic Programming#GeneticAlgorithm|genetic algorithms]], [https://en.wikipedia.org/wiki/Analysis_of_algorithms analysis of algorithms], [https://en.wikipedia.org/wiki/Concrete_Mathematics concrete mathematics], [https://en.wikipedia.org/wiki/NP-complete NP-completeness], [https://en.wikipedia.org/wiki/Bioinformatics bioinformatics], [https://en.wikipedia.org/wiki/Data_mining data mining] and [[Artificial Intelligence|artificial intelligence]]. Along with [[Hendrik Jan Hoogeboom]] et al., Walter Kosters works on the [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] of [https://en.wikipedia.org/wiki/Tetris Tetris] <ref>[https://www.cs.jhu.edu/~susan/600.363/tetris.pdf Tetris is Hard: An Introduction to P vs NP] (pdf) slides based on [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2002'''). ''Tetris is Hard, Even to Approximate''. [https://arxiv.org/abs/cs/0210020 arXiv:cs/0210020]</ref>, and maintains the ''How to Construct Tetris Configurations'' site <ref>[http://liacs.leidenuniv.nl/~kosterswa/tetris/ How to Construct Tetris Configurations]</ref>. |
=Nonograms= | =Nonograms= | ||
| Line 20: | Line 20: | ||
* [[Joost Batenburg]], [[Walter Kosters]] ('''2005'''). ''[https://www.researchgate.net/publication/220799946_Neural_Networks_for_Discrete_Tomography Neural Networks for Discrete Tomography]''. [https://dblp.uni-trier.de/db/conf/bnaic/bnaic2005.html#BatenburgK05 BNCAI 2005] | * [[Joost Batenburg]], [[Walter Kosters]] ('''2005'''). ''[https://www.researchgate.net/publication/220799946_Neural_Networks_for_Discrete_Tomography Neural Networks for Discrete Tomography]''. [https://dblp.uni-trier.de/db/conf/bnaic/bnaic2005.html#BatenburgK05 BNCAI 2005] | ||
* [[Joost Batenburg]], [[Walter Kosters]] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/11774938_31 A Neural Network Approach to Real-Time Discrete Tomography]''. [https://dblp.uni-trier.de/db/conf/iwcia/iwcia2006.html#BatenburgK06 IWCIA 2006] | * [[Joost Batenburg]], [[Walter Kosters]] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/11774938_31 A Neural Network Approach to Real-Time Discrete Tomography]''. [https://dblp.uni-trier.de/db/conf/iwcia/iwcia2006.html#BatenburgK06 IWCIA 2006] | ||
| − | |||
* [[Joost Batenburg]], [[Walter Kosters]] ('''2009'''). ''Solving Nonograms by combining relaxations''. [http://www.journals.elsevier.com/pattern-recognition/ Pattern Recognition], Vol. 42, No. 8 | * [[Joost Batenburg]], [[Walter Kosters]] ('''2009'''). ''Solving Nonograms by combining relaxations''. [http://www.journals.elsevier.com/pattern-recognition/ Pattern Recognition], Vol. 42, No. 8 | ||
==2010 ...== | ==2010 ...== | ||
| Line 28: | Line 27: | ||
* [[Joost Batenburg]], [[Walter Kosters]] ('''2012'''). ''Nonograms''. [http://www.liacs.nl/ LIACS - Leiden Institute of Advanced Computer Science], [http://www.liacs.nl/~kosters/nvti2012.pdf pdf] | * [[Joost Batenburg]], [[Walter Kosters]] ('''2012'''). ''Nonograms''. [http://www.liacs.nl/ LIACS - Leiden Institute of Advanced Computer Science], [http://www.liacs.nl/~kosters/nvti2012.pdf pdf] | ||
* [[Joost Batenburg]], [[Walter Kosters]] ('''2012'''). ''On the Difficulty of Nonograms''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]] | * [[Joost Batenburg]], [[Walter Kosters]] ('''2012'''). ''On the Difficulty of Nonograms''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]] | ||
| − | * [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Jan van Rijn]], [[Jonathan K. Vis]] ('''2014'''). ''Acyclic Constraint Logic and Games''. [[ICGA Journal#37_1|ICGA Journal, Vol | + | * [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Jan van Rijn]], [[Jonathan K. Vis]] ('''2014, 2016'''). ''Acyclic Constraint Logic and Games''. [[ICGA Journal#37_1|ICGA Journal, Vol 37, No. 1]], [https://arxiv.org/abs/1604.05487 arXiv:1604.05487] |
* [[Jaap van den Herik]], [[Walter Kosters]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2015'''). ''The 18th Computer Olympiad 2015''. [[ICGA Journal#38_4|ICGA Journal, Vol. 38, No. 4]] » [[18th Computer Olympiad]] | * [[Jaap van den Herik]], [[Walter Kosters]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2015'''). ''The 18th Computer Olympiad 2015''. [[ICGA Journal#38_4|ICGA Journal, Vol. 38, No. 4]] » [[18th Computer Olympiad]] | ||
Latest revision as of 18:50, 6 October 2020
Home * People * Walter Kosters
Walter Kosters [1]
Walter A. Kosters,
a Dutch computer scientist and mathematician, and associate professor of CS at LIACS, the Leiden Institute of Advanced Computer Science at Leiden University. His research interests include neural networks, genetic algorithms, analysis of algorithms, concrete mathematics, NP-completeness, bioinformatics, data mining and artificial intelligence. Along with Hendrik Jan Hoogeboom et al., Walter Kosters works on the computational complexity of Tetris [2], and maintains the How to Construct Tetris Configurations site [3].
Contents
Nonograms
Along with Joost Batenburg, Walter Kosters researches on Nonograms [4], picture logic puzzles where a pixel grid has to be filled with black and white pixels, based on a description that indicates the lengths of the consecutive black segments for each row and column. In this puzzle type, the numbers are a form of discrete tomography that measures how many unbroken lines of filled-in squares there are in any given row or column. While the Nonograms that can be found in puzzle books can typically be solved by applying a series of highly local reasoning steps regarding single rows and columns, the general Nonogram problem is NP-hard.
Selected Publications
2000 ...
- Maurits D. Out, Walter Kosters (2000). A Bayesian approach to combined neural networks forecasting. ESANN 2000
- Walter Kosters, Wim Pijls (2003). APRIORI, A Depth First Implementation. FIMI 2003, pdf
- Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter Kosters, David Liben-Nowell (2004). Tetris is hard, even to approximate. International Journal of Computational Geometry & Applications, Vol. 14
- Hendrik Jan Hoogeboom, Walter Kosters (2004). Tetris and Decidability. Information Processing Letters, Vol. 9
- Hendrik Jan Hoogeboom, Walter Kosters (2004). How to Construct Tetris Configurations. International Journal of Intelligent Games & Simulation, Vol. 3
- Hendrik Jan Hoogeboom, Walter Kosters (2005). The Theory of Tetris. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, Vol. 9
- Joost Batenburg, Walter Kosters (2005). Neural Networks for Discrete Tomography. BNCAI 2005
- Joost Batenburg, Walter Kosters (2006). A Neural Network Approach to Real-Time Discrete Tomography. IWCIA 2006
- Joost Batenburg, Walter Kosters (2009). Solving Nonograms by combining relaxations. Pattern Recognition, Vol. 42, No. 8
2010 ...
- Jonathan K. Vis, Walter Kosters, Antonio Terroba (2010). Tennis Patterns: Player, Match and Beyond. BNAIC 2010, pdf
- Antonio Terroba, Walter Kosters, Jonathan K. Vis (2010). Tactical Analysis Modeling through Data Mining: Pattern Discovery in Racket Sports. KDIR 2010, pdf
- Jonathan K. Vis, Walter Kosters, Joost Batenburg (2011). Discrete Tomography: A Neural Network Approach. BNAIC 2011 pdf
- Joost Batenburg, Walter Kosters (2012). Nonograms. LIACS - Leiden Institute of Advanced Computer Science, pdf
- Joost Batenburg, Walter Kosters (2012). On the Difficulty of Nonograms. ICGA Journal, Vol. 35, No. 4
- Hendrik Jan Hoogeboom, Walter Kosters, Jan van Rijn, Jonathan K. Vis (2014, 2016). Acyclic Constraint Logic and Games. ICGA Journal, Vol 37, No. 1, arXiv:1604.05487
- Jaap van den Herik, Walter Kosters, Aske Plaat, Johanna Hellemons (2015). The 18th Computer Olympiad 2015. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad
External Links
References
- ↑ Walter Kosters
- ↑ Tetris is Hard: An Introduction to P vs NP (pdf) slides based on Erik D. Demaine, Susan Hohenberger, David Liben-Nowell (2002). Tetris is Hard, Even to Approximate. arXiv:cs/0210020
- ↑ How to Construct Tetris Configurations
- ↑ Nonogram — Turn your picture into a puzzle
- ↑ dblp: Walter A. Kosters
