default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDávid Hanák
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Gergely Hanczár
, Marcell Stippinger, Dávid Hanák, Marcell T. Kurbucz, Olivér M. Törteli, Ágnes Chripkó, Zoltán Somogyvári:
Feature space reduction method for ultrahigh-dimensional, multiclass data: random forest-based multiround screening (RFMS). Mach. Learn. Sci. Technol. 4(4): 45012 (2023)- [j3]Marcell Stippinger, Dávid Hanák, Marcell T. Kurbucz, Gergely Hanczár, Olivér M. Törteli, Zoltán Somogyvári:
BiometricBlender: Ultra-high dimensional, multi-class synthetic data generator to imitate biometric feature space. SoftwareX 22: 101366 (2023) - [i2]Gergely Hanczár, Marcell Stippinger, Dávid Hanák, Marcell T. Kurbucz, Olivér M. Törteli, Ágnes Chripkó, Zoltán Somogyvári:
Feature space reduction method for ultrahigh-dimensional, multiclass data: Random forest-based multiround screening (RFMS). CoRR abs/2305.15793 (2023) - 2022
- [i1]Marcell Stippinger, Dávid Hanák, Marcell T. Kurbucz, Gergely Hanczár, Olivér M. Törteli, Zoltán Somogyvári:
BiometricBlender: Ultra-high dimensional, multi-class synthetic data generator to imitate biometric feature space. CoRR abs/2206.10747 (2022)
2000 – 2009
- 2008
- [c6]Barnabás Takács, Dávid Hanák, Kirby G. Vosburgh:
A Virtual Reality Patient and Environments for Image Guided Diagnosis. MIAR 2008: 279-288 - 2007
- [j2]Dávid Hanák, Nagarajan Kandasamy:
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming. Acta Cybern. 18(2): 239-255 (2007) - 2006
- [c5]Pedro A. Szekely, Rajiv T. Maheswaran, Robert Neches, Craig Milo Rogers, Romeo Sanchez, Marcel Becker, Stephen Fitzpatrick, Gergely Gati, Dávid Hanák, Gabor Karsai, Christopher P. van Buskirk:
An Examination of Criticality-Sensitive Approaches to Coordination. AAAI Spring Symposium: Distributed Plan and Schedule Management 2006: 136-142 - [c4]Pedro A. Szekely, Marcel Becker, Stephen Fitzpatrick, Gergely Gati, Dávid Hanák, Jing Jin, Gabor Karsai, Rajiv T. Maheswaran, Robert Neches, Craig Milo Rogers, Romeo Sanchez, Christopher P. van Buskirk:
CSC: Criticality-Sensitive Coordination. AAMAS 2006: 1441-1442 - 2004
- [c3]Dávid Hanák, Tamás Szeredi, Péter Szeredi:
FDBG, the CLPFD Debugger Library of SICStus Prolog. ICLP 2004: 458-459 - [c2]Dávid Hanák, Tamás Szeredi:
FDBG, the CLP(FD) Debugger Library of SICStus Prolog. WLPE 2004 - [c1]Nagarajan Kandasamy, Dávid Hanák, Christopher P. van Buskirk, Himanshu Neema, Gabor Karsai:
Synthesis of robust task schedules for minimum disruption repair. SMC (6) 2004: 5056-5061 - 2003
- [j1]Dávid Hanák:
Implementing Global Constraints as Graphs of Elementary Constraints. Acta Cybern. 16(2): 241-258 (2003)
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-07 22:20 CEST 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:
