default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Hula
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j6]Pavlína Koutecká
, Premysl Sucha, Jan Hula, Broos Maenhout:
A machine learning approach to rank pricing problems in branch-and-price. Eur. J. Oper. Res. 320(2): 328-342 (2025)- 2024
- [c17]Jan Hula, David Mojzísek, Mikolás Janota:
Understanding GNNs for Boolean Satisfiability through Approximation Algorithms. CIKM 2024: 953-961 - [c16]Mikail Khona, Maya Okawa, Jan Hula, Rahul Ramesh, Kento Nishi, Robert P. Dick, Ekdeep Singh Lubana, Hidenori Tanaka:
Towards an Understanding of Stepwise Inference in Transformers: A Synthetic Graph Navigation Model. ICML 2024 - [c15]David Mojzísek, Jan Hula:
Efficient Solver Scheduling and Selection for Satisfiability Modulo Theories (SMT) Problems. ICPRAM 2024: 360-369 - [c14]David Adamczyk, Jan Hula:
Efficient Use of Large Language Models for Analysis of Text Corpora. ICPRAM 2024: 695-705 - [i5]Mikail Khona, Maya Okawa, Jan Hula, Rahul Ramesh, Kento Nishi, Robert P. Dick, Ekdeep Singh Lubana, Hidenori Tanaka:
Towards an Understanding of Stepwise Inference in Transformers: A Synthetic Graph Navigation Model. CoRR abs/2402.07757 (2024) - [i4]Jan Hula, David Mojzísek, Mikolás Janota:
Understanding GNNs for Boolean Satisfiability through Approximation Algorithms. CoRR abs/2408.15418 (2024) - 2023
- [c13]Jan Hula, David Adamczyk, Mikolás Janota:
Fast Heuristic for Ricochet Robots. ICAART (1) 2023: 71-79 - [c12]Petr Hyner, Jan Hula, Mikolás Janota:
Molecule Builder: Environment for Testing Reinforcement Learning Agents. IJCCI 2023: 450-458 - 2022
- [j5]Petr Hurtík, Vojtech Molek, Jan Hula, Marek Vajgl, Pavel Vlasánek, Tomas Nejezchleba:
Poly-YOLO: higher speed, more precise detection and instance segmentation for YOLOv3. Neural Comput. Appl. 34(10): 8275-8290 (2022) - [j4]Petr Hurtík, Stefania Tomasiello, Jan Hula, David Hynar:
Binary cross-entropy with dynamical clipping. Neural Comput. Appl. 34(14): 12029-12041 (2022) - [c11]Jan Hula, David Mojzísek, David Adamczyk:
3D Shapes Classification Using Intermediate Parts Representation. IPMU (2) 2022: 431-442 - [c10]David Mojzísek, Jan Hula:
Image Classifier with Dynamic Set of Known Classes. ITAT 2022: 68-74 - [c9]Xinying Chen, Jan Hula, Antonín Dvorák:
Analysis of the Semantic Vector Space Induced by a Neural Language Model and a Corpus. ITAT 2022: 103-110 - [c8]Jan Hula, Jan Jakubuv, Mikolás Janota, Lukás Kubej:
Targeted Configuration of an SMT Solver. CICM 2022: 256-271 - 2021
- [c7]Jan Hula, David Mojzísek, Mikolás Janota:
Graph Neural Networks for Scheduling of SMT Solvers. ICTAI 2021: 447-451 - [c6]Jan Hula, David Adamczyk, David Mojzísek, Vojtech Molek:
Segmenting out Generic Objects in Monocular Videos. ITAT 2021: 123-129 - 2020
- [j3]Petr Hurtík, Vojtech Molek, Jan Hula:
Data Preprocessing Technique for Neural Networks Based on Image Represented by a Fuzzy Function. IEEE Trans. Fuzzy Syst. 28(7): 1195-1204 (2020) - [c5]Jan Hula, David Mojzísek, David Adamczyk, Radek Cech:
Acquiring Custom OCR System with Minimal Manual Annotation. DSMP 2020: 231-236 - [c4]Jan Hula:
Unsupervised Object-aware Learning from Videos. DSMP 2020: 237-242 - [c3]David Adamczyk, Jan Hula:
Keypoints Selection Using Evolutionary Algorithms. ITAT 2020: 186-191 - [i3]Petr Hurtík, Vojtech Molek, Jan Hula, Marek Vajgl, Pavel Vlasánek, Tomas Nejezchleba:
Poly-YOLO: higher speed, more precise detection and instance segmentation for YOLOv3. CoRR abs/2005.13243 (2020)
2010 – 2019
- 2019
- [j2]Jan Hula, Miroslav Kubát, Radek Cech, Xinying Chen, David Cíz, Katerina Pelegrinová, Jirí Milicka:
Context Specificity of Lemma. Diachronic Analysis. Glottometrics 45: 7-23 (2019) - [j1]Radek Cech, Jan Hula, Miroslav Kubát, Xinying Chen, Jirí Milicka:
The Development of Context Specificity of Lemma. A Word Embeddings Approach. J. Quant. Linguistics 26(3): 187-204 (2019) - [c2]Alex Wang, Jan Hula, Patrick Xia, Raghavendra Pappagari, R. Thomas McCoy, Roma Patel, Najoung Kim, Ian Tenney, Yinghui Huang, Katherin Yu, Shuning Jin, Berlin Chen, Benjamin Van Durme, Edouard Grave, Ellie Pavlick, Samuel R. Bowman:
Can You Tell Me How to Get Past Sesame Street? Sentence-Level Pretraining Beyond Language Modeling. ACL (1) 2019: 4465-4476 - [i2]Waren Long, Vadim Markovtsev, Hugo Mougard, Egor Bulychev, Jan Hula:
Identifying collaborators in large codebases. CoRR abs/1905.06782 (2019) - 2018
- [i1]Samuel R. Bowman, Ellie Pavlick, Edouard Grave, Benjamin Van Durme, Alex Wang, Jan Hula, Patrick Xia, Raghavendra Pappagari, R. Thomas McCoy, Roma Patel, Najoung Kim, Ian Tenney, Yinghui Huang, Katherin Yu, Shuning Jin, Berlin Chen:
Looking for ELMo's friends: Sentence-Level Pretraining Beyond Language Modeling. CoRR abs/1812.10860 (2018) - 2017
- [c1]Jan Hula, Irina Perfilieva, Ali Ahsan Muhummad Muzaheed:
Towards Visual Training Set Generation Framework. IWANN (2) 2017: 747-758
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-11-15 20:41 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:
