default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKave Eshghi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j4]Mehran Kafai
, Kave Eshghi:
CROification: Accurate Kernel Classification with the Efficiency of Sparse Linear SVM. IEEE Trans. Pattern Anal. Mach. Intell. 41(1): 34-48 (2019)- 2016
- [c23]Kave Eshghi, Mehran Kafai:
The CRO kernel: Using Concomitant Rank Order hashes for sparse high dimensional randomized feature maps. ICDE 2016: 721-730 - 2015
- [c22]Mehran Kafai, Kave Eshghi, Le An, Bir Bhanu:
A reference-based framework for pose invariant face recognition. FG 2015: 1-8 - 2014
- [j3]Mehran Kafai, Kave Eshghi, Bir Bhanu:
Discrete Cosine Transform Locality-Sensitive Hashes for Face Retrieval. IEEE Trans. Multim. 16(4): 1090-1103 (2014) - [c21]Vinay Deolalikar, Kave Eshghi:
Lightweight approximate top-k for distributed settings. IEEE BigData 2014: 835-844 - 2013
- [c20]Mark Lillibridge, Kave Eshghi, Deepavali Bhagwat:
Improving restore speed for backup systems that use inline chunk-based deduplication. FAST 2013: 183-198 - 2012
- [c19]Vinay Deolalikar, Kave Eshghi, Hernan Laffitte:
A Lightweight Distributed Order and Duplication Insensitive Algorithm for Approximate Top-k Queries using Order Statistics. COMAD 2012: 111
2000 – 2009
- 2009
- [j2]George Forman, Kave Eshghi, Jaap Suermondt:
Efficient detection of large-scale redundancy in enterprise file systems. ACM SIGOPS Oper. Syst. Rev. 43(1): 84-91 (2009) - [c18]Mark Lillibridge, Kave Eshghi, Deepavali Bhagwat, Vinay Deolalikar, Greg Trezis, Peter Camble:
Sparse Indexing: Large Scale, Inline Deduplication Using Sampling and Locality. FAST 2009: 111-123 - [c17]Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey III, Joseph A. Tucek, Alistair C. Veitch:
Applying syntactic similarity algorithms for enterprise information management. KDD 2009: 1087-1096 - [c16]Deepavali Bhagwat, Kave Eshghi, Darrell D. E. Long, Mark Lillibridge:
Extreme Binning: Scalable, parallel deduplication for chunk-based file backup. MASCOTS 2009: 1-9 - 2008
- [c15]Kave Eshghi, Shyamsundar Rajaram:
Locality sensitive hash functions based on concomitant rank order statistics. KDD 2008: 221-229 - 2007
- [c14]Kave Eshghi, Mark Lillibridge, Lawrence Wilcock, Guillaume Belrose, Rycharde Hawkes:
Jumbo Store: Providing Efficient Incremental Upload and Versioning for a Utility Rendering Service. FAST 2007: 123-138 - [c13]Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra:
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus. KDD 2007: 105-112 - 2005
- [c12]George Forman, Kave Eshghi, Stephane Chiocchetti:
Finding similar files in large document repositories. KDD 2005: 394-400 - 2002
- [c11]Pankaj K. Garg, Kave Eshghi, Thomas Gschwind, Boudewijn R. Haverkort, Katinka Wolter:
Enabling Network Caching of Dynamic Web Objects. Computer Performance Evaluation / TOOLS 2002: 329-338 - [c10]Kave Eshghi:
Intrinsic References in Distributed Systems. ICDCS Workshops 2002: 675-680 - [c9]Thomas Gschwind, Kave Eshghi, Pankaj K. Garg, Klaus Wurster:
WebMon: A Performance Profiler for Web Transactions. WECWIS 2002: 171-176
1990 – 1999
- 1995
- [c8]Kave Eshghi, M. Mowbray:
Side Effect Analysis for Logic-Based Planning. GULP-PRODE 1995: 139-147 - [c7]Adrian R. Pell, Kave Eshghi, Jean-Jacques Moreau, Simon J. Towers:
Managing in a distributed world. Integrated Network Management 1995: 94-105 - 1994
- [j1]Chris Preist, Kave Eshghi, Bruno Bertolino:
Consistency-Based and Abductive Diagnoses as Generalized Stable Models. Ann. Math. Artif. Intell. 11(1-4): 51-74 (1994) - 1993
- [c6]Kave Eshghi:
A Tractable Class of Abduction Problems. IJCAI 1993: 3-8 - 1992
- [c5]Chris Preist, Kave Eshghi:
Consistency-Based and Abductive Diagnoses as Generalised Stable Models. FGCS 1992: 514-521 - 1990
- [c4]Kave Eshghi:
Computing Stable Models by Using the ATMS. AAAI 1990: 272-277
1980 – 1989
- 1989
- [c3]Kave Eshghi, Robert A. Kowalski:
Abduction Compared with Negation by Failure. ICLP 1989: 234-254 - 1988
- [c2]Kave Eshghi:
Abductive Planning with Event Calculus. ICLP/SLP 1988: 562-579 - 1987
- [b1]Kave Eshghi:
Meta-language in logic programming. Imperial College London, UK, 1987 - 1982
- [c1]Kave Eshghi:
Application of Meta-language Programming to Fault Finding in Logic Circuits. ICLP 1982: 240-246
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:04 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:
