Jan H. M. Korst
According to our database1, Jan H. M. Korst authored at least 61 papers between 1987 and 2019.
Legend:Book In proceedings Article PhD thesis Other
An exact algorithm for the minimum quartet tree cost problem.
Introduction to Classification Algorithms and Their Performance Analysis Using Medical Examples.
Proceedings of the Data Science for Healthcare - Methodologies and Applications, 2019
Theory of Local Search.
Proceedings of the Handbook of Heuristics., 2018
On the minimum quartet tree cost problem.
Improved Variable Neighbourhood Search Heuristic for Quartet Clustering.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018
Computer-assisted proof of performance ratios for the Differencing Method.
Discret. Optim., 2012
Enhanced Semantic TV-Show Representation for Personalized Electronic Program Guides.
Proceedings of the User Modeling, Adaptation, and Personalization, 2012
TV-Show Retrieval and Classification.
Proceedings of the 3rd Italian Information Retrieval Workshop, 2012
Finding Shadows among Disks.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012
Heuristic Approaches for the Quartet Method of Hierarchical Clustering.
IEEE Trans. Knowl. Data Eng., 2010
Personalized Implicit Learning in a Music Recommender System.
Proceedings of the User Modeling, 2010
Integrating broadcast and web video content into personal tv channels.
Proceedings of the 2010 ACM Conference on Recommender Systems, 2010
Candle in the woods: asymptotic bounds on minimum blocking sets.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009
Minimum blocking sets of circles for a set of lines in the plane.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008
Determining causal and non-causal relationships in biomedical text by classifying verbs using a Naive Bayesian Classifier.
Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing, 2008
Enriching music with synchronized lyrics, images and colored lights.
Proceedings of the 1st International ICST Conference on Ambient Media and Systems, 2008
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem.
ACM Trans. Math. Softw., 2007
Tabletop Collaboration through Tangible Interactions.
Proceedings of the 16th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises (WETICE 2007), 2007
Creating a Dead Poets Society: Extracting a Social Network of Historical Persons from the Web.
Proceedings of the Semantic Web, 2007
Tool Play Live: Dealing with Ambiguity in Artist Similarity Mining from the Web.
Proceedings of the 8th International Conference on Music Information Retrieval, 2007
Theoretical aspects of local search.
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-35853-4, 2007
Efficient Lyrics Extraction from the Web.
Proceedings of the ISMIR 2006, 2006
Web-Based Artist Categorization.
Proceedings of the ISMIR 2006, 2006
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems.
Operations Research, 2005
Automatic Ontology Population by Googling.
Proceedings of the BNAIC 2005, 2005
Bus and Buffer Usage in In-Home Digital Networks: Applying the Dantzig-Wolfe Decomposition.
J. Scheduling, 2004
Optimal Bus and Buffer Allocation for a Set of Leaky-Bucket-Controlled Streams.
Proceedings of the Telecommunications and Networking, 2004
Privacy Protection in Memory-Based Collaborative Filtering.
Proceedings of the Ambient Intelligence: Second European Symposium, 2004
Smoothing Streams in an In-Home Digital Network: Optimization of Bus and Buffer Usage.
Telecommunication Systems, 2003
On the Guaranteed Throughput of Multizone Disks.
IEEE Trans. Computers, 2003
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems.
IEEE Trans. Computers, 2003
Complexity of min-max subsequence problems.
Inf. Process. Lett., 2003
Performance Ratios for the Karmarkar-Karp Differencing Method.
Electron. Notes Discret. Math., 2003
Fast Concurrent Access to Parallel Disks.
Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
Approximation of a Retrieval Problem for Parallel Disks.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
Improving Disk Efficiency in Video Servers by Random Redundant Storage.
Proceedings of the Internet and Multimedia Systems and Applications, 2002
Comments on "carry-over round robin: a simple cell scheduling mechanism for ATM network".
IEEE/ACM Trans. Netw., 2001
Random duplicate storage strategies for load balancing in multimedia servers.
Inf. Process. Lett., 2000
Comparing disk scheduling algorithms for VBR data streams.
Comput. Commun., 1998
Scheduling Periodic Tasks with Slack.
INFORMS Journal on Computing, 1997
Random Duplicated Assignment: An Alternative to Striping in Video Servers.
Proceedings of the Fifth ACM International Conference on Multimedia '97, 1997
Disk Scheduling for Variable-Rate Data Streams.
Proceedings of the Interactive Distributed Multimedia Systems and Telecommunication Services, 1997
The complexity of generalized retiming problems.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1996
Storing Continuous-Media Data on a Compact Disc.
Multimedia Syst., 1996
Scheduling Periodic Tasks.
INFORMS Journal on Computing, 1996
Improved force-directed scheduling in high-throughput digital signal processing.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1995
Compact Disc Standards: An Introductory Overview.
Multimedia Syst., 1994
Periodic Assignment and Graph Colouring.
Discret. Appl. Math., 1994
Efficiency improvements for force-directed scheduling.
Proceedings of the 1992 IEEE/ACM International Conference on Computer-Aided Design, 1992
An efficient macro-cell placement algorithm.
Boltzmann Machines as a Model for Parallel Annealing.
Periodic Multiprocessor Scheduling.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991
Architecture and Programming of a VLIW Style Programmable Video Signal Processor.
Proceedings of the 24th Annual IEEE/ACM International Symposium on Microarchitecture, 1991
Scheduling in Programmable Video Signal Processors.
Proceedings of the 1991 IEEE/ACM International Conference on Computer-Aided Design, 1991
Improved force-directed scheduling.
Proceedings of the conference on European design automation, 1991
Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing.
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-92146-2, 1990
Computations in massively parallel networks based on the Boltzmann machine: a review.
Parallel Comput., 1989
Combinatorial Optimization on a Boltzmann Machine.
J. Parallel Distributed Comput., 1989
Boltzmann Machines and their Applications.
Proceedings of the PARLE, 1987