Search results
Hace 4 días · Bernard Chazelle is a computer scientist and mathematician at Princeton University, who has made significant contributions to computational geometry and natural algorithms. He is a fellow of the European Academy of Sciences and the author of \"The Discrepancy Method\".
17 de may. de 2024 · Maximum inner product search (MIPS) over dense and sparse vectors have progressed independently in a bifurcated literature for decades; the latter is better known as top- k k retrieval in Information Retrieval. This duality exists because sparse and dense vectors serve different end goals.
Hace 4 días · Searching for approximate nearest neighbors (ANN) in the high-dimensional Euclidean space is a pivotal problem. Recently, with the help of fast SIMD-based implementations, Product Quantization (PQ) and its variants can often efficiently and accurately ...
Hace 3 días · Bernard Chazelle. The Discrepancy Method: Randomness and Complexity. Cambridge University Press, New York, 2001. URL: http://www.cs.princeton.edu/~chazelle/book.html .
25 de may. de 2024 · The uniform binary search was developed by A. K. Chandra of Stanford University in 1971. [9] In 1986, Bernard Chazelle and Leonidas J. Guibas introduced fractional cascading as a method to solve numerous search problems in computational geometry. [46] [60] [61]
Hace 6 días · The Discrepancy Method — Randomness and Complexity by Bernard Chazelle. Review by Jin-Yi Cai.
22 de may. de 2024 · Rohit Parikh: Propositional Game Logic. 195-200 Sarit Kraus, Daniel Lehmann: Decision Procedures for Time and Chance (Extended Abstract). 202-209 Yuri Gurevich: Algebras of Feasible Functions. 210-214 Joffroy Beauquier, Françoise Gire: On Context-Free Generators. 215 Bernard Chazelle, Leonidas J. Guibas, D. T. Lee: The Power of ...
