• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 19 matches

• 2023
• 
  Idan Kligvasser, George Leifman, Roman Goldenberg, Ehud Rivlin, Michael Elad:
  Semi-supervised Quality Evaluation of Colonoscopy Procedures. ICCV (Workshops) 2023: 2347-2355
• 
  George Leifman, Idan Kligvasser, Roman Goldenberg, Ehud Rivlin, Michael Elad:
  Colonoscopy Coverage Revisited: Identifying Scanning Gaps in Real-Time. CaPTion@MICCAI 2023: 107-118
• 
  George Leifman, Idan Kligvasser, Roman Goldenberg, Michael Elad, Ehud Rivlin:
  Colonoscopy Coverage Revisited: Identifying Scanning Gaps in Real-Time. CoRR abs/2305.10026 (2023)
• 
  Idan Kligvasser, George Leifman, Roman Goldenberg, Ehud Rivlin, Michael Elad:
  Semi-supervised Quality Evaluation of Colonoscopy Procedures. CoRR abs/2305.10090 (2023)
• 2021
• 
  Eilam Goldenberg Leleo, Idan Segev:
  Burst control: Synaptic conditions for burst generation in cortical layer 5 pyramidal neurons. PLoS Comput. Biol. 17(11) (2021)
• 2013
• 
  Idan Goldenberg, David Burshtein:
  The Approximate Maximum-Likelihood Certificate. IEEE Trans. Inf. Theory 59(9): 6049-6059 (2013)
• 2011
• 
  Idan Goldenberg, David Burshtein:
  Error bounds for repeat-accumulate codes decoded via linear programming. Adv. Math. Commun. 5(4): 555-570 (2011)
• 
  David Burshtein, Idan Goldenberg:
  Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance. IEEE Trans. Inf. Theory 57(11): 7386-7402 (2011)
• 
  David Burshtein, Idan Goldenberg:
  Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. ISIT 2011: 1263-1267
• 
  Idan Goldenberg, David Burshtein:
  The approximate maximum-likelihood certificate. ISIT 2011: 1278-1282
• 
  Idan Goldenberg, David Burshtein:
  The approximate maximum-likelihood certificate. CoRR abs/1105.3006 (2011)
• 2010
• 
  David Burshtein, Idan Goldenberg:
  Improved linear programming decoding and bounds on the minimum distance of LDPC codes. ITW 2010: 1-5
• 
  David Burshtein, Idan Goldenberg:
  Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance. CoRR abs/1012.1425 (2010)
• 2009
• 
  Idan Goldenberg, David Burshtein:
  Upper bound on error exponent of regular LDPC codes transmitted over the BEC. IEEE Trans. Inf. Theory 55(6): 2674-2681 (2009)
• 
  Idan Goldenberg, David Burshtein:
  Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming. CoRR abs/0904.1692 (2009)
• 2008
• 
  Idan Goldenberg, David Burshtein:
  Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC. CoRR abs/0803.2460 (2008)
• 2007
• 
  Igal Sason, Idan Goldenberg:
  Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes. IEEE Trans. Inf. Theory 53(7): 2394-2428 (2007)
• 2006
• 
  Igal Sason, Idan Goldenberg:
  Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations. CoRR abs/cs/0607002 (2006)
• 
  Igal Sason, Idan Goldenberg:
  Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes. CoRR abs/cs/0609099 (2006)