default search action
Robert R. Snapp
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [i1]Robert R. Snapp, Gil I. Shamir:
Synthesizing Irreproducibility in Deep Networks. CoRR abs/2102.10696 (2021)
2010 – 2019
- 2018
- [r2]Robert R. Snapp:
Probabilistic Analysis. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - 2014
- [r1]Robert R. Snapp:
Probabilistic Analysis. Encyclopedia of Social Network Analysis and Mining 2014: 1362-1388 - 2012
- [j6]Gary W. Johnson
, Kenneth J. Bagstad
Service Path Attribution Networks (SPANs): A Network Flow Approach to Ecosystem Service Assessment. Int. J. Agric. Environ. Inf. Syst. 3(2): 54-71 (2012) - 2010
- [c13]Gary W. Johnson
Service Path Attribution Networks (SPANs): Spatially Quantifying the Flow of Ecosystem Services from Landscapes to People. ICCSA (1) 2010: 238-253
2000 – 2009
- 2006
- [c12]Xianhua Jiang, Yuichi Motai, Robert R. Snapp, Xingquan Zhu:
Accelerated Kernel Feature Analysis. CVPR (1) 2006: 109-116 - [c11]Robert R. Snapp:
A Puzzles-First approach to computer science. ITiCSE 2006: 310 - [c10]Robert R. Snapp:
Teaching graph algorithms in a corn maze. ITiCSE 2006: 347 - 2005
- [j5]Zhen He
Self-tuning cost modeling of user-defined functions in an object-relational DBMS. ACM Trans. Database Syst. 30(3): 812-853 (2005) - 2004
- [c9]Zhen He
Self-tuning UDF Cost Modeling Using the Memory-Limited Quadtree. EDBT 2004: 513-531 - 2003
- [j4]Byung Suk Lee, Terence Critchlow, Ghaleb Abdulla, Chuck Baldwin, Roy Kamimura
The framework for approximate queries on simulation data. Inf. Sci. 157: 3-20 (2003) - 2002
- [j3]Byung Suk Lee, Robert R. Snapp, Ron Musick, Terence Critchlow:
Metadata models for ad hoc queries on terabyte-scale scientific simulations. J. Braz. Comput. Soc. 8(1): 0-15 (2002) - 2001
- [c8]Byung Suk Lee, Robert R. Snapp, Ron Musick:
Toward a Query Language on Simulation Mesh Data: An Object-oriented Approach. DASFAA 2001: 242-249 - [c7]Ghaleb Abdulla, Chuck Baldwin, Terence Critchlow, Roy Kamimura
Approximate ad-hoc query engine for simulation data. JCDL 2001: 255-256 - [c6]Byung Suk Lee, Robert R. Snapp, Ron Musick, Terence Critchlow:
Ad hoc Query Support for Very Large Scientific Data: the Metadata Approach. SBBD 2001: 199-212
1990 – 1999
- 1998
- [c5]Alessandro M. Palau, Robert R. Snapp:
The labelled cell classifier: a fast approximation to k nearest neighbors. ICPR 1998: 823-827 - 1995
- [c4]Robert R. Snapp, Tong Xu:
Estimating the Bayes Risk from Sample Data. NIPS 1995: 232-238 - 1994
- [j2]Demetri Psaltis, Robert R. Snapp, Santosh S. Venkatesh:
On the finite sample performance of the nearest neighbor classifier. IEEE Trans. Inf. Theory 40(3): 820-837 (1994) - [c3]Robert R. Snapp, Santosh S. Venkatesh:
Asymptotic predictions of the finite-sample risk of the k-nearest-neighbor classifier. ICPR (2) 1994: 1-6 - 1992
- [c2]Santosh S. Venkatesh, Robert R. Snapp, Demetri Psaltis:
Bellman Strikes Again! The Growth Rate of Sample Complexity with Dimension for the Nearest Neighbor Classifier. COLT 1992: 93-102 - 1990
- [j1]Chuanyi Ji, Robert R. Snapp, Demetri Psaltis:
Generalizing Smoothness Constraints from Discrete Samples. Neural Comput. 2(2): 188-197 (1990) - [c1]Robert R. Snapp, Demetri Psaltis, Santosh S. Venkatesh:
Asymptotic Slowing Down of the Nearest-Neighbor Classifier. NIPS 1990: 932-938
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-07 21:20 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: