4 citations · 8 across the 5 of their papers we have counts for
6 papers
RSLM: Training-Free Vector Quantization for Approximate Nearest Neighbor Search
Rastislav Lenhardt, Teodora Dobos, Thomas Vecchiato +2
By introducing RSLM (Rotated Scaled Lloyd-Max), a family of training-free vector quantization codecs compressing embeddings to 1--4 bits per dimension, we reduce memory cost and me…
Semantic Recall for Vector Search
Leonardo Kuffo, Ioanna Tsakalidou, Roberta De Viti +3
We introduce Semantic Recall, a novel metric to assess the quality of approximate nearest neighbor search algorithms by considering only semantically relevant objects that are theo…
Model Checking Markov Chains Against Unambiguous Buchi Automata
Michael Benedikt, Rastislav Lenhardt, James Worrell
We give a polynomial-time algorithm for model checking finite Markov chains against omega-regular specifications given as unambiguous Buchi automata.
Controlling the Depth, Size, and Number of Subtrees for Two-variable Logic on Trees
Saguy Benaim, Michael Benedikt, Rastislav Lenhardt +1
Verification of properties of first order logic with two variables FO2 has been investigated in a number of contexts. Over arbitrary structures it is known to be decidable with NEX…
Two Variable vs. Linear Temporal Logic in Model Checking and Games
Michael Benedikt, Rastislav Lenhardt, James Worrell
Model checking linear-time properties expressed in first-order logic has non-elementary complexity, and thus various restricted logical languages are employed. In this paper we con…
Proof of Concept: Fast Solutions to NP-problems by Using SAT and Integer Programming Solvers
Rastislav Lenhardt
In the last decade, the power of the state-of-the-art SAT and Integer Programming solvers has dramatically increased. They implement many new techniques and heuristics and since an…