Difference between revisions of "Walter Kosters"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * People * Walter Kosters''' FILE:walterkosters.jpg|border|right|thumb|link=http://www.liacs.nl/~kosters/|Walter Kosters <ref>[http://www.liacs.nl...")
 
Line 10: Line 10:
  
 
=Selected Publications=
 
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/k/Kosters:Walter_A=.html DBLP: Walter A. Kosters]</ref>
+
<ref>[https://dblp.uni-trier.de/pers/hd/k/Kosters:Walter_A=.html dblp: Walter A. Kosters]</ref>
 +
==2000 ...==
 +
* [https://dblp.uni-trier.de/pers/hd/o/Out:Maurits_D= Maurits D. Out], [[Walter Kosters]] ('''2000'''). ''[https://www.researchgate.net/publication/2610192_A_Bayesian_Approach_to_Combined_Neural_Networks_Forecasting A Bayesian approach to combined neural networks forecasting]''. [https://dblp.uni-trier.de/db/conf/esann/esann2000.html ESANN 2000]
 +
* [[Walter Kosters]], [[Wim Pijls]] ('''2003'''). ''APRIORI, A Depth First Implementation''. FIMI 2003, [http://ceur-ws.org/Vol-90/kosters.pdf pdf]
 
* [http://www.informatik.uni-trier.de/~ley/pers/hd/b/Breukelaar:Ron Ron Breukelaar], [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2004'''). ''Tetris is hard, even to approximate''. [http://www.worldscientific.com/worldscinet/ijcga International Journal of Computational Geometry & Applications], Vol. 14
 
* [http://www.informatik.uni-trier.de/~ley/pers/hd/b/Breukelaar:Ron Ron Breukelaar], [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2004'''). ''Tetris is hard, even to approximate''. [http://www.worldscientific.com/worldscinet/ijcga 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'''). ''Tetris and Decidability''. Information Processing Letters, Vol. 9
Line 16: Line 19:
 
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2005'''). ''[http://www.ibrarian.net/navon/page.jsp?paperid=3095440&searchTerm=3+3v The Theory of Tetris]''. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, Vol. 9
 
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2005'''). ''[http://www.ibrarian.net/navon/page.jsp?paperid=3095440&searchTerm=3+3v The Theory of Tetris]''. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, Vol. 9
 
* [[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 ...==
 
* [[Jonathan K. Vis]], [[Walter Kosters]], [http://dblp.uni-trier.de/pers/hd/a/Acha:Antonio_Terroba Antonio Terroba] ('''2010'''). ''Tennis Patterns: Player, Match and Beyond''. [http://bnaic2010.uni.lu/ BNAIC 2010], [http://www.liacs.nl/~jvis/bnaic2010.pdf pdf]
 
* [[Jonathan K. Vis]], [[Walter Kosters]], [http://dblp.uni-trier.de/pers/hd/a/Acha:Antonio_Terroba Antonio Terroba] ('''2010'''). ''Tennis Patterns: Player, Match and Beyond''. [http://bnaic2010.uni.lu/ BNAIC 2010], [http://www.liacs.nl/~jvis/bnaic2010.pdf pdf]
 
* [http://dblp.uni-trier.de/pers/hd/a/Acha:Antonio_Terroba Antonio Terroba], [[Walter Kosters]], [[Jonathan K. Vis]] ('''2010'''). ''Tactical Analysis Modeling through Data Mining: Pattern Discovery in Racket Sports''. [http://www.kdir.ic3k.org/KDIR2010/ KDIR 2010], [http://www.liacs.nl/~jvis/kdir2010.pdf pdf]
 
* [http://dblp.uni-trier.de/pers/hd/a/Acha:Antonio_Terroba Antonio Terroba], [[Walter Kosters]], [[Jonathan K. Vis]] ('''2010'''). ''Tactical Analysis Modeling through Data Mining: Pattern Discovery in Racket Sports''. [http://www.kdir.ic3k.org/KDIR2010/ KDIR 2010], [http://www.liacs.nl/~jvis/kdir2010.pdf pdf]
Line 32: Line 36:
 
=References=  
 
=References=  
 
<references />
 
<references />
 
 
'''[[People|Up one level]]'''
 
'''[[People|Up one level]]'''
 +
[[Category:Mathematician|Pijls]]
 +
[[Category:Researcher|Pijls]]

Revision as of 23:02, 15 January 2019

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].

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

[5]

2000 ...

2010 ...

External Links

References

Up one level