Unverified50% confidenceFactExact time
Parallel prefix sum (parallel prefix sum / scan) is a classic algorithm for parallelizing associative recurrence operations, and algorithms such as the Blelloch scan can complete accumulation in O(log n) steps.
1
Sources
50%
Confidence
Long-term
Relevance
10/19/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedBinary search locates an element in a sorted array in only O(log n) comparisons, and the search and insertion operations of a balanced binary search tree also have O(log n) time complexity.64% similarUnverifiedAn interval tree is an augmented balanced binary search tree keyed by intervals, supporting the query "all intervals overlapping a given interval" in O(log n + k) time.62% similarUnverifiedParameter sweeping is a key means of finding the optimal inference configuration (such as batch size, parallelism strategy, memory allocation, etc.).62% similarUnverifiedReranking uses a cross-encoder to score query-document pairs one by one, with accuracy far higher than vector similarity but at higher computational cost, so fine ranking is done only on the small number of candidates after coarse ranking, forming a two-stage architecture of coarse ranking plus fine ranking.60% similarUnverifiedPattern Scanning 通过搜索函数开头的特征字节序列（签名）来动态定位目标函数或数据结构，实现跨版本兼容60% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1070373API
curl https://kongchang.com/api/v1/knowledge/claims/1070373MCP
get_claim(id=1070373)