default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSepehr Eghbali
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
[b1]Sepehr Eghbali:
Scalable Nearest Neighbor Search with Compact Codes. University of Waterloo, Ontario, Canada, 2019
Journal Articles
- 2020
- [j3]Sepehr Eghbali
, Mohammad Hassan Zokaei Ashtiani, Ladan Tahvildari:
Online Nearest Neighbor Search Using Hamming Weight Trees. IEEE Trans. Pattern Anal. Mach. Intell. 42(7): 1729-1740 (2020) - 2019
- [j2]Sepehr Eghbali, Ladan Tahvildari:
Fast Cosine Similarity Search in Binary Space with Angular Multi-Index Hashing. IEEE Trans. Knowl. Data Eng. 31(2): 329-342 (2019) - 2016
- [j1]Sepehr Eghbali, Ladan Tahvildari:
Test Case Prioritization Using Lexicographical Ordering. IEEE Trans. Software Eng. 42(12): 1178-1195 (2016)
Conference and Workshop Papers
- 2023
- [c9]Ershad Banijamali, Pegah Kharazmi, Sepehr Eghbali, Jixuan Wang, Clement Chung, Samridhi Choudhary:
Pyramid Dynamic Inference: Encouraging Faster Inference Via Early Exit Boosting. ICASSP 2023: 1-5 - 2021
- [c8]Hamidreza Saghir, Samridhi Choudhary, Sepehr Eghbali, Clement Chung:
Factorization-Aware Training of Transformers for Natural Language Understanding on the Edge. Interspeech 2021: 4733-4737 - 2019
- [c7]Sepehr Eghbali, Ladan Tahvildari:
Discriminative Quantization for Fast Similarity Search. CVPR Workshops 2019: 0 - [c6]Sepehr Eghbali, Ladan Tahvildari:
Deep Spherical Quantization for Image Search. CVPR 2019: 11690-11699 - [c5]Sepehr Eghbali, Vinit Kudva, Gregg Rothermel, Ladan Tahvildari:
Supervised tie breaking in test case prioritization. ICSE (Companion Volume) 2019: 242-243 - 2017
- [c4]Sepehr Eghbali, Mohammad Hassan Zokaei Ashtiani, Ladan Tahvildari:
Online Nearest Neighbor Search in Binary Space. ICDM 2017: 853-858 - 2016
- [c3]Masoud Safilian, S. Mehdi Hashemi, Sepehr Eghbali, Aliakbar Safilian:
An Approximation Algorithm for the Subpath Planning Problem. IJCAI 2016: 669-675 - 2012
- [c2]Sepehr Eghbali, Majid Nili Ahmadabadi, Babak Nadjar Araabi, Maryam S. Mirian:
Learning Attentive Fusion of Multiple Bayesian Network Classifiers. ICONIP (3) 2012: 133-140 - [c1]Sepehr Eghbali, Mohammad Hassan Zokaei Ashtiani, Majid Nili Ahmadabadi, Babak Nadjar Araabi:
Bandit-Based Structure Learning for Bayesian Network Classifiers. ICONIP (2) 2012: 349-356
Informal and Other Publications
- 2019
- [i4]Sepehr Eghbali, Ladan Tahvildari:
Deep Spherical Quantization for Image Search. CoRR abs/1906.02865 (2019) - [i3]Seyed Mehran Kazemi, Rishab Goel, Sepehr Eghbali, Janahan Ramanan, Jaspreet Sahota, Sanjay Thakur, Stella Wu, Cathal Smyth, Pascal Poupart, Marcus A. Brubaker:
Time2Vec: Learning a Vector Representation of Time. CoRR abs/1907.05321 (2019) - 2016
- [i2]Masoud Safilian, S. Mehdi Tashakkori, Sepehr Eghbali, Aliakbar Safilian:
An Approximation Approach for Solving the Subpath Planning Problem. CoRR abs/1603.06217 (2016) - [i1]Sepehr Eghbali, Ladan Tahvildari:
Cosine Similarity Search with Multi Index Hashing. CoRR abs/1610.00574 (2016)
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-04-24 23:01 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:
