The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jan H. M. Korst: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gijs Geleijnse, Jan H. M. Korst
    Automatic Ontology Population by Googling. [Citation Graph (0, 0)][DBLP]
    BNAIC, 2005, pp:120-126 [Conf]
  2. Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma
    Approximation of a Retrieval Problem for Parallel Disks. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:178-188 [Conf]
  3. Wim F. J. Verhaegh, Aukje E. M. van Duijnhoven, Pim Tuyls, Jan H. M. Korst
    Privacy Protection in Memory-Based Collaborative Filtering. [Citation Graph (0, 0)][DBLP]
    EUSAI, 2004, pp:61-71 [Conf]
  4. Gerben Essink, Emile H. L. Aarts, R. van Dongen, P. van Gerwen, Jan H. M. Korst, Kees A. Vissers
    Scheduling in Programmable Video Signal Processors. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1991, pp:284-287 [Conf]
  5. Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jan H. M. Korst, Albert van der Werf, Jef L. van Meerbergen
    Efficiency improvements for force-directed scheduling. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1992, pp:286-291 [Conf]
  6. Edgar den Boef, Jan H. M. Korst, Wim F. J. Verhaegh
    Optimal Bus and Buffer Allocation for a Set of Leaky-Bucket-Controlled Streams. [Citation Graph (0, 0)][DBLP]
    ICT, 2004, pp:1337-1346 [Conf]
  7. Jan H. M. Korst, Verus Pronk, Pascal Coumans
    Disk Scheduling for Variable-Rate Data Streams. [Citation Graph (0, 0)][DBLP]
    IDMS, 1997, pp:119-132 [Conf]
  8. Joep Aerts, Jan H. M. Korst, Wim F. J. Verhaegh
    Improving Disk Efficiency in Video Servers by Random Redundant Storage. [Citation Graph (0, 0)][DBLP]
    IMSA, 2002, pp:354-359 [Conf]
  9. Gijs Geleijnse, Jan H. M. Korst
    Web-Based Artist Categorization. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2006, pp:266-271 [Conf]
  10. Gijs Geleijnse, Jan H. M. Korst
    Efficient Lyrics Extraction from the Web. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2006, pp:371-372 [Conf]
  11. Gerben Essink, Emile H. L. Aarts, R. van Dongen, P. van Gerwen, Jan H. M. Korst, Kees A. Vissers
    Architecture and Programming of a VLIW Style Programmable Video Signal Processor. [Citation Graph (0, 0)][DBLP]
    MICRO, 1991, pp:181-188 [Conf]
  12. Jan H. M. Korst
    Random Duplicated Assignment: An Alternative to Striping in Video Servers. [Citation Graph (0, 0)][DBLP]
    ACM Multimedia, 1997, pp:219-226 [Conf]
  13. Emile H. L. Aarts, Jan H. M. Korst
    Boltzmann Machines and their Applications. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1987, pp:34-50 [Conf]
  14. Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels
    Periodic Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1991, pp:166-178 [Conf]
  15. Peter Sanders, Sebastian Egner, Jan H. M. Korst
    Fast concurrent access to parallel disks. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:849-858 [Conf]
  16. Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen
    Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:583-595 [Conf]
  17. Emile H. L. Aarts, Jan H. M. Korst
    Boltzmann Machines as a Model for Parallel Annealing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:3, pp:437-465 [Journal]
  18. Peter Sanders, Sebastian Egner, Jan H. M. Korst
    Fast Concurrent Access to Parallel Disks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:1, pp:21-55 [Journal]
  19. Jan H. M. Korst, Verus Pronk, Pascal Coumans, Giel van Doren, Emile H. L. Aarts
    Comparing disk scheduling algorithms for VBR data streams. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 1998, v:21, n:15, pp:1328-1343 [Journal]
  20. Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels
    Periodic Assignment and Graph Colouring. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:3, pp:291-305 [Journal]
  21. Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra
    Scheduling Periodic Tasks with Slack. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 1997, v:9, n:4, pp:351-362 [Journal]
  22. Joep Aerts, Jan H. M. Korst, Sebastian Egner
    Random duplicate storage strategies for load balancing in multimedia servers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:51-59 [Journal]
  23. Wil Michiels, Jan H. M. Korst
    Complexity of min-max subsequence problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:4, pp:213-217 [Journal]
  24. Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen
    Performance ratios of the Karmarkar-Karp differencing method. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:13, n:1, pp:19-32 [Journal]
  25. Jan H. M. Korst, Emile H. L. Aarts
    Combinatorial Optimization on a Boltzmann Machine. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1989, v:6, n:2, pp:331-357 [Journal]
  26. Jan H. M. Korst
    Compact Disc Standards: An Introductory Overview. [Citation Graph (0, 0)][DBLP]
    Multimedia Syst., 1994, v:2, n:4, pp:157-171 [Journal]
  27. Jan H. M. Korst, Verus Pronk
    Storing Continuous-Media Data on a Compact Disc. [Citation Graph (0, 0)][DBLP]
    Multimedia Syst., 1996, v:4, n:4, pp:187-196 [Journal]
  28. Emile H. L. Aarts, Jan H. M. Korst
    Computations in massively parallel networks based on the Boltzmann machine: a review. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1989, v:9, n:2, pp:129-145 [Journal]
  29. Edgar den Boef, Wim F. J. Verhaegh, Jan H. M. Korst
    Bus and Buffer Usage in In-Home Digital Networks: Applying the Dantzig-Wolfe Decomposition. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:2, pp:119-131 [Journal]
  30. Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma, Wim F. J. Verhaegh, Gerhard J. Woeginger
    Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2003, v:52, n:9, pp:1210-1214 [Journal]
  31. Wil Michiels, Jan H. M. Korst, Joep Aerts
    On the Guaranteed Throughput of Multizone Disks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2003, v:52, n:11, pp:1407-1420 [Journal]
  32. Babette van Antwerpen-de Fluiter, Emile H. L. Aarts, Jan H. M. Korst, Wim F. J. Verhaegh, Albert van der Werf
    The complexity of generalized retiming problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1996, v:15, n:11, pp:1340-1353 [Journal]
  33. Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jan H. M. Korst, Jef L. van Meerbergen, Albert van der Werf
    Improved force-directed scheduling in high-throughput digital signal processing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1995, v:14, n:8, pp:945-960 [Journal]
  34. Edgar den Boef, Wim F. J. Verhaegh, Jan H. M. Korst
    Smoothing Streams in an In-Home Digital Network: Optimization of Bus and Buffer Usage. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2003, v:23, n:3-4, pp:273-295 [Journal]
  35. Verus Pronk, Jan H. M. Korst
    Comments on "carry-over round robin: a simple cell scheduling mechanism for ATM network". [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2001, v:9, n:3, pp:373- [Journal]
  36. Gijs Geleijnse, Jan H. M. Korst
    Creating a Dead Poets Society: Extracting a Social Network of Historical Persons from the Web. [Citation Graph (0, 0)][DBLP]
    ISWC/ASWC, 2007, pp:156-168 [Conf]
  37. Silvano Martello, David Pisinger, Daniele Vigo, Edgar den Boef, Jan H. M. Korst
    Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 2007, v:33, n:1, pp:7- [Journal]

  38. Minimum blocking sets of circles for a set of lines in the plane. [Citation Graph (, )][DBLP]


  39. Candle in the woods: asymptotic bounds on minimum blocking sets. [Citation Graph (, )][DBLP]


  40. Personalized Implicit Learning in a Music Recommender System. [Citation Graph (, )][DBLP]


  41. Tabletop Collaboration through Tangible Interactions. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.308secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002