22 citations · 31 across the 8 of their papers we have counts for
8 papers
Knowing When to Quit: A Principled Framework for Dynamic Abstention in LLM Reasoning
Hen Davidov, Nachshon Cohen, Oren Kalinsky +4
LLMs utilizing chain-of-thought reasoning often waste substantial compute by producing long, incorrect responses. Abstention can mitigate this by withholding outputs unlikely to be…
HotelQuEST: Balancing Quality and Efficiency in Agentic Search
Guy Hadad, Shadi Iskander, Oren Kalinsky +3
Agentic search has emerged as a promising paradigm for adaptive retrieval systems powered by large language models (LLMs). However, existing benchmarks primarily focus on quality,…
ChaI-TeA: A Benchmark for Evaluating Autocompletion of Interactions with LLM-based Chatbots
Shani Goren, Oren Kalinsky, Tomer Stav +6
The rise of LLMs has deflected a growing portion of human-computer interactions towards LLM-based chatbots. The remarkable abilities of these models allow users to interact using l…
Evaluating D-MERIT of Partial-annotation on Information Retrieval
Royi Rassin, Yaron Fairstein, Oren Kalinsky +4
Retrieval models are often evaluated on partially-annotated datasets. Each query is mapped to a few relevant texts and the remaining corpus is assumed to be irrelevant. As a result…
The TrieJax Architecture: Accelerating Graph Operations Through Relational Joins
Oren Kalinsky, Benny Kimelfeld, Yoav Etsion
Graph pattern matching (e.g., finding all cycles and cliques) has become an important component in many critical domains such as social networks, biology, and cyber-security. This…
Efficiently Charting RDF
Oren Kalinsky, Oren Mishali, Aidan Hogan +2
We propose a visual query language for interactively exploring large-scale knowledge graphs. Starting from an overview, the user explores bar charts through three interactions: cla…
eLinda: Explorer for Linked Data
Oren Mishali, Tal Yahav, Oren Kalinsky +1
To realize the premise of the Semantic Web towards knowledgeable machines, one might often integrate an application with emerging RDF graphs. Nevertheless, capturing the content of…
Flexible Caching in Trie Joins
Oren Kalinsky, Yoav Etsion, Benny Kimelfeld
Traditional algorithms for multiway join computation are based on rewriting the order of joins and combining results of intermediate subqueries. Recently, several approaches have b…