default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmir Ingber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Sebastian Bruch
, Siyu Gai, Amir Ingber:
An Analysis of Fusion Functions for Hybrid Retrieval. ACM Trans. Inf. Syst. 42(1): 20:1-20:35 (2024)- [j6]Sebastian Bruch, Franco Maria Nardini, Amir Ingber, Edo Liberty:
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors. ACM Trans. Inf. Syst. 42(2): 42:1-42:43 (2024) - [i13]Harsha Vardhan Simhadri, Martin Aumüller, Amir Ingber, Matthijs Douze, George Williams, Magdalen Dobson Manohar, Dmitry Baranchuk, Edo Liberty, Frank Liu, Benjamin Landrum, Mazin Karjikar, Laxman Dhulipala, Meng Chen, Yue Chen, Rui Ma, Kai Zhang, Yuzheng Cai, Jiayang Shi, Yizhuo Chen, Weiguo Zheng, Zihao Wan, Jie Yin, Ben Huang:
Results of the Big ANN: NeurIPS'23 competition. CoRR abs/2409.17424 (2024) - 2023
- [i12]Sebastian Bruch, Franco Maria Nardini, Amir Ingber, Edo Liberty:
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors. CoRR abs/2301.10622 (2023) - [i11]Sebastian Bruch, Franco Maria Nardini, Amir Ingber, Edo Liberty:
Bridging Dense and Sparse Maximum Inner Product Search. CoRR abs/2309.09013 (2023) - 2022
- [c26]Nachshon Cohen, Amit Portnoy, Besnik Fetahu, Amir Ingber:
SDR: Efficient Neural Re-ranking using Succinct Document Representation. ACL (1) 2022: 6624-6637 - [c25]David Carmel, Nachshon Cohen, Amir Ingber, Elad Kravi:
IR Evaluation and Learning in the Presence of Forbidden Documents. SIGIR 2022: 556-566 - [i10]Sebastian Bruch, Siyu Gai, Amir Ingber:
An Analysis of Fusion Functions for Hybrid Retrieval. CoRR abs/2210.11934 (2022) - 2021
- [i9]Nachshon Cohen, Amit Portnoy, Besnik Fetahu, Amir Ingber:
SDR: Efficient Neural Re-ranking using Succinct Document Representation. CoRR abs/2110.02065 (2021)
2010 – 2019
- 2017
- [c24]Dmitri S. Pavlichin, Amir Ingber, Tsachy Weissman:
Compressing Tabular Data via Pairwise Dependencies. DCC 2017: 455 - [c23]Aryan Mokhtari, Amir Ingber:
A Diagonal-Augmented quasi-Newton method with application to factorization machines. ICASSP 2017: 2671-2675 - 2016
- [j5]Fabian Steiner, Steffen Dempfle, Amir Ingber, Tsachy Weissman:
Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes. IEEE Trans. Inf. Theory 62(5): 2737-2747 (2016) - [j4]Albert No, Amir Ingber, Tsachy Weissman:
Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff. IEEE Trans. Inf. Theory 62(6): 3618-3635 (2016) - 2015
- [j3]Amir Ingber, Thomas A. Courtade, Tsachy Weissman:
Compression for Quadratic Similarity Queries. IEEE Trans. Inf. Theory 61(5): 2729-2747 (2015) - [j2]Sergey Tridenski, Ram Zamir, Amir Ingber:
The Ziv-Zakai-Rényi Bound for Joint Source-Channel Coding. IEEE Trans. Inf. Theory 61(8): 4293-4315 (2015) - [c22]Amir Ingber, Tsachy Weissman:
Compression for Similarity Identification: Computing the Error Exponent. DCC 2015: 413-422 - [i8]Albert No, Amir Ingber, Tsachy Weissman:
Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff. CoRR abs/1506.03407 (2015) - 2014
- [c21]Idoia Ochoa, Amir Ingber, Tsachy Weissman:
Compression Schemes for Similarity Queries. DCC 2014: 332-341 - [c20]Amir Ingber, Tsachy Weissman:
Compression for similarity identification: Fundamental limits. ISIT 2014: 1-5 - [c19]Albert No, Amir Ingber, Tsachy Weissman:
Strong successive refinability: Sufficient conditions. ISIT 2014: 2659-2663 - [c18]Steffen Dempfle, Fabian Steiner, Amir Ingber, Tsachy Weissman:
Compression for quadratic similarity queries via shape-gain quantizers. ISIT 2014: 2839-2843 - [i7]Fabian Steiner, Steffen Dempfle, Amir Ingber, Tsachy Weissman:
Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes. CoRR abs/1404.5173 (2014) - 2013
- [j1]Amir Ingber, Ram Zamir, Meir Feder:
Finite-Dimensional Infinite Constellations. IEEE Trans. Inf. Theory 59(3): 1630-1656 (2013) - [c17]Idoia Ochoa, Amir Ingber, Tsachy Weissman:
Efficient similarity queries via lossy compression. Allerton 2013: 883-889 - [c16]Albert No, Amir Ingber, Tsachy Weissman:
Complexity and rate-distortion tradeoff via successive refinement. Allerton 2013: 1531-1536 - [c15]Amir Ingber, Thomas A. Courtade, Tsachy Weissman:
Quadratic Similarity Queries on Compressed Data. DCC 2013: 441-450 - [c14]Amir Ingber, Thomas A. Courtade, Tsachy Weissman:
Compression for exact match identification. ISIT 2013: 654-658 - [i6]Amir Ingber, Thomas A. Courtade, Tsachy Weissman:
Compression for Quadratic Similarity Queries. CoRR abs/1307.6609 (2013) - [i5]Amir Ingber, Tsachy Weissman:
The Minimal Compression Rate for Similarity Identification. CoRR abs/1312.2063 (2013) - 2012
- [c13]Amir Ingber, Da Wang, Yuval Kochman:
Dispersion theorems via second order analysis of functions of distributions. CISS 2012: 1-6 - [c12]Amir Ingber, Ram Zamir:
Expurgated infinite constellations at finite dimensions. ISIT 2012: 130-134 - [c11]Da Wang, Amir Ingber, Yuval Kochman:
A strong converse for joint source-channel coding. ISIT 2012: 2117-2121 - 2011
- [c10]Da Wang, Amir Ingber, Yuval Kochman:
The dispersion of joint source-channel coding. Allerton 2011: 180-187 - [c9]Amir Ingber, Yuval Kochman:
The Dispersion of Lossy Source Coding. DCC 2011: 53-62 - [c8]Amir Ingber, Ram Zamir, Meir Feder:
The dispersion of infinite constellations. ISIT 2011: 1407-1411 - [i4]Amir Ingber, Yuval Kochman:
The Dispersion of Lossy Source Coding. CoRR abs/1102.2598 (2011) - [i3]Amir Ingber, Ram Zamir, Meir Feder:
The Optimal Density of Infinite Constellations for the Gaussian Channel. CoRR abs/1103.0171 (2011) - [i2]Da Wang, Amir Ingber, Yuval Kochman:
The Dispersion of Joint Source-Channel Coding. CoRR abs/1109.6310 (2011) - 2010
- [c7]Amir Ingber, Meir Feder:
Parallel bit interleaved coded modulation. Allerton 2010: 215-222 - [i1]Amir Ingber, Meir Feder:
Parallel Bit Interleaved Coded Modulation. CoRR abs/1007.1407 (2010)
2000 – 2009
- 2009
- [c6]Amir Ingber, Meir Feder:
Capacity and error exponent analysis of multilevel coding with multistage decoding. ISIT 2009: 1799-1803 - 2008
- [c5]Amir Ingber:
Simple Joint Source-Channel Coding Schemes for Colored Gaussian Sources. DCC 2008: 522 - [c4]Amir Ingber, Itai Leibowitz, Ram Zamir, Meir Feder:
Distortion lower bounds for finite dimensional joint source-channel coding. ISIT 2008: 1183-1187 - 2007
- [c3]Amir Ingber, Meir Feder:
Power Preserving 2: 1 Bandwidth Reduction Mappings. DCC 2007: 385 - 2006
- [c2]Amir Ingber, Meir Feder:
Non-Asymptotic Design of Finite State Universal Predictors for Individual Sequences. DCC 2006: 3-12 - [c1]Amir Ingber, Meir Feder:
Prediction of Individual Sequences using Universal Deterministic Finite State Machines. ISIT 2006: 421-425
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
