Results 11 to 20 of about 13,396 (303)

Fault-Aware Neural Code Rankers [PDF]

open access: green, 2022
In the proceedings of Advances in Neural Information Processing Systems ...
Jeevana Priya Inala   +7 more
openalex   +3 more sources

Complementing Büchi Automata with Ranker (Technical Report) [PDF]

open access: green, 2022
We present the tool Ranker for complementing Büchi automata (BAs). Ranker builds on our previous optimizations of rank-based BA complementation and pushes them even further using numerous heuristics to produce even smaller automata. Moreover, it contains novel optimizations of specialized constructions for complementing (i) inherently weak automata and
Vojtěch Havlena   +2 more
openalex   +3 more sources

Hybrid retrievers with generative re-rankers [PDF]

open access: diamondAnnals of Computer Science and Information Systems, 2023
Marek Kozłowski
openalex   +3 more sources

Visual re-ranking with natural language understanding for text spotting [PDF]

open access: yes, 2018
The final publication is available at link.springer.comMany scene text recognition approaches are based on purely visual information and ignore the semantic relation between scene and text.
Moreno-Noguer, Francesc   +2 more
core   +3 more sources

Conelikes and Ranker Comparisons

open access: yes, 2022
For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation problem asks for two given languages whether they can be separated by a language from the fixed class. And thirdly,
Henriksson, Viktor, Kufleitner, Manfred
openaire   +2 more sources

InRanker: Distilled Rankers for Zero-shot Information Retrieval [PDF]

open access: green
Despite multi-billion parameter neural rankers being common components of state-of-the-art information retrieval pipelines, they are rarely used in production due to the enormous amount of compute required for inference. In this work, we propose a new method for distilling large rankers into their smaller versions focusing on out-of-domain ...
Thiago Laitz   +3 more
openalex   +3 more sources

A cost-sensitive online learning method for peptide identification

open access: yesBMC Genomics, 2020
Background Post-database search is a key procedure in peptide identification with tandem mass spectrometry (MS/MS) strategies for refining peptide-spectrum matches (PSMs) generated by database search engines.
Xijun Liang   +5 more
doaj   +1 more source

Mineral characterization of soil type ranker formed on serpentines occurring in southern Belgrade environs Bubanj Potok [PDF]

open access: yesNuclear Technology and Radiation Protection, 2012
The paper addresses the issue of health risk associated with the presence of chrysotile in the soil type ranker formed on massive serpentines occurring in the area of Bubanj Potok, a settlement located in the southern Belgrade environs, Serbia ...
Cekić Božidar Đ.   +6 more
doaj   +1 more source

Phytocenological and edaphic characteristics of sessile oak forests on Miroč Mt in northeastern Serbia [PDF]

open access: yesGlasnik Šumarskog Fakulteta: Univerzitet u Beogradu, 2013
This research was carried out in natural stands of sessile oak (Quercus petraea agg. Ehrendorfer 1967) on Miroč mountain. Three comunities were investigated: Pure sessile oak forest (Quercetum montanum Čer. et Jov. 1953.
Cvjetićanin Rade   +4 more
doaj   +1 more source

Deterministic Temporal Logics and Interval Constraints [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2017
In temporal logics, a central question is about the choice of modalities and their relative expressive power, in comparison to the complexity of decision problems such as satisfiability.
Kamal Lodaya, Paritosh K. Pandya
doaj   +1 more source

Home - About - Disclaimer - Privacy