NishiSearch

Web This site Trusted

25 result(s) for “okapi bm25 site terms com pp site github com site can kernel org site:arxiv.org” of 55 matched · page 2 · 769 ms

Scope: Nishi’s own index (our crawl + Common Crawl) — not the whole live web. Some sites block all automated crawlers (anti-bot walls), so their pages may be absent here even though we never filter lawful content.

Freshness: no result on this page carries a fetch time yet (indexed before the fetch epoch was stored beside the doc)

Mathematics

https://arxiv.org/list/math/new
up to 2000 entries per page: fewer | more | all New submissions (showing 219 of 219 entries) [1] arXiv:2608

[2608.03883] DS@GT-ARC at eRisk 2026 Task 3: Sparse, Semantic, and LLM

https://arxiv.org/abs/2608.03883
Our systems combine sparse BM25 retrieval, evidence-aware rescoring for self-referential symptom reports, embedding-based reranking, query-prototype expansion, and LLM-based reranking

[2104.08663] BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of

https://arxiv.org/abs/2104.08663
Our results show BM25 is a robust baseline and re-ranking and late-interaction-based models on average achieve the best zero-shot performances, however, at high computational costs

Information Retrieval

https://arxiv.org/list/cs.IR/recent
IR) Tue, 4 Aug 2026 (showing first 34 of 45 entries ) [17] arXiv:2608

Information Retrieval

https://arxiv.org/list/cs.IR/new
Our results show that skill representation itself matters, and that simply preserving the structure already present in skill files can substantially improve retrieval

Statistics Theory Mar 2024

https://arxiv.org/list/math.ST/2024-03
00186 [pdf, html, other] Title: Warped Kernel Estimator for I

Databases

https://arxiv.org/list/cs.DB/new
We propose an architectural pattern for such systems, a trusted kernel with a generative shell, resting on one invariant: a component that can fabricate may influence which question the system answers, never which value it returns

Distributed, Parallel, and Cluster Computing

https://arxiv.org/list/cs.DC/new
SE) Automating GPU kernel optimization remains difficult in practice: generated variants can violate correctness constraints, runtime measurements are noisy, and search often stalls early

Operating Systems

https://arxiv.org/list/cs.OS/new
| all New submissions (showing 2 of 2 entries) [1] arXiv:2608

[2512.09590] On Inhomogeneous Affine Volterra Processes: Stationarity

https://arxiv.org/abs/2512.09590
09590] On Inhomogeneous Affine Volterra Processes: Stationarity and Applications to the Volterra Heston Model Skip to main content arXiv is now an independent nonprofit

[2608.01651] Bole: Efficient Tree Speculation for Hybrid-Attention

https://arxiv.org/abs/2608.01651
We present Bole, a kernel--runtime co-design that enables efficient tree speculation for hybrid-attention LLMs

Computer Science > Computation and Language

https://arxiv.org/abs/2609.14858
--> Computer Science > Computation and Language arXiv:2609

Physics > Computational Physics

https://arxiv.org/abs/1202.3424
, dust particles), but may also be 1-d or 2-d periodic arrays of "target unit cells", which can be used to study absorption, scattering, and electric fields around arrays of nanostructures

Electrical Engineering and Systems Science

https://arxiv.org/list/eess/new
The design relies on two affine Volterra transformations involving both Fredholm- and Volterra-type integral terms, which results in a four-PIDE kernel equations

Hardware Architecture

https://arxiv.org/list/cs.AR/new
more | all New submissions (showing 4 of 4 entries) [1] arXiv:2608

Statistics Theory

https://arxiv.org/list/math.ST/new
| all New submissions (showing 6 of 6 entries) [1] arXiv:2608

Instrumentation and Methods for Astrophysics

https://arxiv.org/list/astro-ph.IM/new
In particular, the maximal light deflection of a given Solar System body can be easily estimated for a given observer

Numerical Analysis

https://arxiv.org/list/cs.NA/new
all New submissions (showing 18 of 18 entries) [1] arXiv:2608

Cryptography and Security

https://arxiv.org/list/cs.CR/new
fewer | more | all New submissions (showing 32 of 32 entries) [1] arXiv:2608

Finite-Time Analysis of Asynchronous Multi-Agent TD Learning

https://arxiv.org/html/2407.20441v1
I Introduction Training reinforcement learning (RL) algorithms is well-known to be a critically time consuming task that can require several data samples to achieve a desired level of accuracy

Stochastic Games with Minimally Bounded Action Costs

https://arxiv.org/html/2407.18010v2
We prove the game respects a dynamic programming principle and that the Markov perfect equilibrium can be computed as a limit point of a sequence of Bellman operations

Homogeneous Distributed Observers for Quasilinear Systems

https://arxiv.org/html/2407.05763v1
However, centralized observers for plants modeled by nonlinear systems satisfying Ho¨¨o\ddot{\mathrm{o}}over¨ start_ARG roman_o end_ARGlder condition can be found in the recent literature (see, e

Computer Science > Programming Languages

https://arxiv.org/abs/2504.02246
--> Computer Science > Programming Languages arXiv:2504

Machine Learning Dec 2024

https://arxiv.org/list/cs.LG/2024-12
3251-3298 Showing up to 50 entries per page: fewer | more | all [1] arXiv:2412

Solar and Stellar Astrophysics

https://arxiv.org/list/astro-ph.SR/new
per page: fewer | more | all New submissions (showing 19 of 19 entries) [1] arXiv:2608