default search action
Verus Pronk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [p2]Willem van Jaarsveld, Alp Akçay, Laurens Bliek, Paulo da Costa, Mathijs de Weerdt, Rik Eshuis, Stella Kapodistria, Uzay Kaymak, Verus Pronk, Geert-Jan van Houtum, Peter Verleijsdonk, Sicco Verwer, Simon Voorberg, Yingqian Zhang:
Real-Time Data-Driven Maintenance Logistics: A Public-Private Collaboration. Commit2Data 2024: 5:1-5:13 - 2022
- [j7]Jan H. M. Korst, Verus Pronk, Jarke J. van Wijk:
Family metro maps. J. Vis. 25(2): 325-341 (2022) - 2020
- [c10]Jan H. M. Korst, Verus Pronk, Jarke J. van Wijk:
A visualization of family relations inspired by the London metro map. VINCI 2020: 8:1-8:8
2010 – 2019
- 2019
- [p1]Jan H. M. Korst, Verus Pronk, Mauro Barbieri, Sergio Consoli
:
Introduction to Classification Algorithms and Their Performance Analysis Using Medical Examples. Data Science for Healthcare 2019: 39-73 - 2012
- [c9]Cataldo Musto, Fedelucio Narducci, Pasquale Lops, Giovanni Semeraro, Marco de Gemmis, Mauro Barbieri, Jan H. M. Korst, Verus Pronk, Ramon Clout:
TV-Show Retrieval and Classification. IIR 2012: 179-182 - [c8]Cataldo Musto
Enhanced Semantic TV-Show Representation for Personalized Electronic Program Guides. UMAP 2012: 188-199 - 2010
- [c7]Verus Pronk, Mauro Barbieri, Jan H. M. Korst, Adolf Proidl:
Integrating broadcast and web video content into personal tv channels. RecSys 2010: 355-356 - [c6]Suzana Kordumova, Ivana Kostadinovska, Mauro Barbieri, Verus Pronk, Jan H. M. Korst:
Personalized Implicit Learning in a Music Recommender System. UMAP 2010: 351-362
2000 – 2009
- 2009
- [c5]Natasa Jovanovic, Jan H. M. Korst, Ramon Clout, Verus Pronk, Ludo Tolhuizen:
Candle in the woods: asymptotic bounds on minimum blocking sets. SCG 2009: 148-152 - 2007
- [c4]Verus Pronk, Wim F. J. Verhaegh, Adolf Proidl, Marco Tiemann
Incorporating user control into recommender systems based on naive bayesian classification. RecSys 2007: 73-80 - 2005
- [c3]Verus Pronk, S. V. R. Gutta, Wim F. J. Verhaegh:
Incorporating Confidence in a Naive Bayesian Classifier. User Modeling 2005: 317-326 - 2001
- [j6]Verus Pronk, Jan H. M. Korst:
Comments on "carry-over round robin: a simple cell scheduling mechanism for ATM network". IEEE/ACM Trans. Netw. 9(3): 373 (2001) - 2000
- [j5]Dee Denteneer, Verus Pronk, J. M. Griffiths, Laurie G. Cuthbert
Impact of the resource needed for renegotiating ATM rates. Comput. Networks 34(1): 211-225 (2000)
1990 – 1999
- 1999
- [j4]David Morris, Verus Pronk:
Charging for ATM services. IEEE Commun. Mag. 37(5): 133-139 (1999) - 1998
- [j3]Jan H. M. Korst, Verus Pronk, Pascal Coumans, Giel van Doren, Emile H. L. Aarts:
Comparing disk scheduling algorithms for VBR data streams. Comput. Commun. 21(15): 1328-1343 (1998) - [c2]Dee Denteneer, Verus Pronk:
Traffic Models for Telecommunication. COMPSTAT 1998: 269-274 - 1997
- [j2]Carel-Jan L. van Driel, Peter A. M. van Grinsven, Verus Pronk, Wilfred A. M. Snijders:
The (R)evolution of access networks for the information superhighway. IEEE Commun. Mag. 35(6): 104-112 (1997) - [c1]Jan H. M. Korst, Verus Pronk, Pascal Coumans:
Disk Scheduling for Variable-Rate Data Streams. IDMS 1997: 119-132 - 1996
- [j1]Jan H. M. Korst, Verus Pronk:
Storing Continuous-Media Data on a Compact Disc. Multim. Syst. 4(4): 187-196 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: