default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Kirshner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j1]Sebastián Moreno
, Jennifer Neville, Sergey Kirshner:
Tied Kronecker Product Graph Models to Capture Variance in Network Populations. ACM Trans. Knowl. Discov. Data 12(3): 35:1-35:40 (2018)
Conference and Workshop Papers
- 2019
- [c13]Yina Tang, Fedor Borisyuk, Siddarth Malreddy, Yixuan Li, Yiqun Liu, Sergey Kirshner:
MSURU: Large Scale E-commerce Image Classification with Weakly Supervised Search Data. KDD 2019: 2518-2526 - 2014
- [c12]Sebastián Moreno, Joseph J. Pfeiffer III, Jennifer Neville, Sergey Kirshner:
A Scalable Method for Exact Sampling from Kronecker Family Models. ICDM 2014: 440-449 - 2013
- [c11]Sebastián Moreno, Jennifer Neville, Sergey Kirshner:
Learning mixed kronecker product graph models with simulated method of moments. KDD 2013: 1052-1060 - 2010
- [c10]Sebastián Moreno, Sergey Kirshner, Jennifer Neville, S. V. N. Vishwanathan:
Tied Kronecker product graph models to capture variance in network populations. Allerton 2010: 1137-1144 - [c9]Barnabás Póczos, Sergey Kirshner, Csaba Szepesvári:
REGO: Rank-based Estimation of Renyi Information using Euclidean Graph Optimization. AISTATS 2010: 605-612 - 2008
- [c8]Sergey Kirshner, Barnabás Póczos:
ICA and ISA using Schweizer-Wolff measure of dependence. ICML 2008: 464-471 - 2007
- [c7]Sergey Kirshner, Padhraic Smyth:
Infinite mixtures of trees. ICML 2007: 417-423 - [c6]Sergey Kirshner:
Learning with Tree-Averaged Densities and Distributions. NIPS 2007: 761-768 - 2004
- [c5]Sergey Kirshner, Padhraic Smyth, Andrew Robertson:
Conditional Chow-Liu Tree Structures for Modeling Discrete-Valued Vector Time Series. UAI 2004: 317-314 - 2003
- [c4]Sergey Kirshner, Sridevi Parise, Padhraic Smyth:
Unsupervised Learning with Permuted Data. ICML 2003: 345-352 - 2002
- [c3]Sergey Kirshner, Igor V. Cadez, Padhraic Smyth, Chandrika Kamath, Erick Cantú-Paz:
Probabilistic Model-Based Detection of Bent-Double Radio Galaxies. ICPR (2) 2002: 499-502 - [c2]Sergey Kirshner, Igor V. Cadez, Padhraic Smyth, Chandrika Kamath:
Learning to Classify Galaxy Shapes Using the EM Algorithm. NIPS 2002: 1497-1504 - 2000
- [c1]David H. Wolpert, Sergey Kirshner, Christopher J. Merz, Kagan Tumer:
Adaptivity in agent-based routing for data networks. Agents 2000: 396-403
Informal and Other Publications
- 2012
- [i4]Lin Yuan, Sergey Kirshner, Robert Givan:
Estimating Densities with Non-Parametric Exponential Families. CoRR abs/1206.5036 (2012) - [i3]Sergey Kirshner, Padhraic Smyth, Andrew Robertson:
Conditional Chow-Liu Tree Structures for Modeling Discrete-Valued Vector Time Series. CoRR abs/1207.4142 (2012) - 2011
- [i2]Dalton D. Lunga, Sergey Kirshner:
Generating Similar Graphs From Spherical Features. CoRR abs/1105.2965 (2011) - 1999
- [i1]David H. Wolpert, Sergey Kirshner, Christopher J. Merz, Kagan Tumer:
Adaptivity in Agent-Based Routing for Data Networks. CoRR cs.MA/9912011 (1999)
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:15 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:
