default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonid Peshkin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[i13]Nicholas J. A. Harvey, David R. Karger, Virginia Savova, Leonid Peshkin:
Matroids Hitting Sets and Unsupervised Dependency Grammar Induction. CoRR abs/1705.08992 (2017)- 2014
- [i12]Leonid Peshkin, Kee-Eung Kim, Nicolas Meuleau, Leslie Pack Kaelbling:
Learning to Cooperate via Policy Search. CoRR abs/1408.1484 (2014) - 2013
- [i11]Brenda Ng, Leonid Peshkin, Avi Pfeffer:
Factored Particles for Scalable Monitoring. CoRR abs/1301.0590 (2013) - [i10]Nicolas Meuleau, Leonid Peshkin, Kee-Eung Kim, Leslie Pack Kaelbling:
Learning Finite-State Controllers for Partially Observable Environments. CoRR abs/1301.6721 (2013) - 2011
- [c14]Carlos Cano, Alberto Labarga
, Armando Blanco, Leonid Peshkin:
Collaborative semi-automatic annotation of the biomedical literature. ISDA 2011: 1213-1217
2000 – 2009
- 2009
- [j4]Carlos Cano, Thomas Monaghan, Armando Blanco, Dennis P. Wall, Leonid Peshkin:
Collaborative text-annotation resource for disease-centered relation extraction from biomedical text. J. Biomed. Informatics 42(5): 967-977 (2009) - 2007
- [j3]Ben Wellner, Matt Huyck, Scott A. Mardis, John S. Aberdeen, Alexander A. Morgan, Leonid Peshkin, Alexander S. Yeh, Janet Hitzeman, Lynette Hirschman:
Research Paper: Rapidly Retargetable Approaches to De-identification in Medical Records. J. Am. Medical Informatics Assoc. 14(5): 564-573 (2007) - [c13]Leonid Peshkin:
Structure induction by lossless graph compression. DCC 2007: 53-62 - [c12]Virginia Savova, Leonid Peshkin:
Is the Turing Test Good Enough? The Fallacy of Resource-Unbounded Intelligence. IJCAI 2007: 545-550 - [i9]Leonid Peshkin:
Structure induction by lossless graph compression. CoRR abs/cs/0703132 (2007) - [i8]Virginia Savova, Leonid Peshkin:
Dependency Parsing with Dynamic Bayesian Network. CoRR abs/cs/0703135 (2007) - [i7]Leonid Peshkin, Virginia Savova:
Reinforcement Learning for Adaptive Routing. CoRR abs/cs/0703138 (2007) - 2006
- [j2]Todd F. DeLuca, I-Hsien Wu, Jian Pu, Thomas Monaghan, Leonid Peshkin, Saurav Singh, Dennis P. Wall:
Roundup: a multi-genome repository of orthologs and evolutionary distances. Bioinform. 22(16): 2044-2046 (2006) - 2005
- [c11]Virginia Savova, Leonid Peshkin:
Dependency Parsing with Dynamic Bayesian Network. AAAI 2005: 1112-1117 - 2003
- [c10]Leonid Peshkin, Avi Pfeffer:
Bayesian Information Extraction Network. IJCAI 2003: 421-426 - [c9]Leonid Peshkin, Avi Pfeffer, Virginia Savova:
Bayesian Nets for Syntactic Categorization of Novel Words. HLT-NAACL 2003 - [c8]Virginia Savova, Leonid Peshkin:
Part-of-speech tagging with minimal lexicalization. RANLP 2003: 163-172 - [i6]Leonid Peshkin, Avi Pfeffer:
Bayesian Information Extraction Network. CoRR cs.CL/0306039 (2003) - [i5]Virginia Savova, Leonid Peshkin:
Part-of-Speech Tagging with Minimal Lexicalization. CoRR cs.CL/0312060 (2003) - 2002
- [b1]Leonid Peshkin:
Reinforcement Learning by Policy Search. Brown University, USA, 2002 - [c7]Leonid Peshkin, Christian R. Shelton:
Learning from Scarce Experience. ICML 2002: 498-505 - [c6]Brenda Ng, Leonid Peshkin, Avi Pfeffer:
Factored Particles for Scalable Monitoring. UAI 2002: 370-377 - [i4]Leonid Peshkin, Christian R. Shelton:
Learning from Scarce Experience. CoRR cs.AI/0204043 (2002) - 2001
- [c5]Leonid Peshkin, Sayan Mukherjee:
Bounds on Sample Size for Policy Evaluation in Markov Environments. COLT/EuroCOLT 2001: 616-630 - [i3]Leonid Peshkin, Nicolas Meuleau, Leslie Pack Kaelbling:
Learning Policies with External Memory. CoRR cs.LG/0103003 (2001) - [i2]Leonid Peshkin, Sayan Mukherjee:
Bounds on sample size for policy evaluation in Markov environments. CoRR cs.LG/0105027 (2001) - [i1]Leonid Peshkin, Kee-Eung Kim, Nicolas Meuleau, Leslie Pack Kaelbling:
Learning to Cooperate via Policy Search. CoRR cs.LG/0105032 (2001) - 2000
- [c4]Leonid Peshkin, Kee-Eung Kim, Nicolas Meuleau, Leslie Pack Kaelbling:
Learning to Cooperate via Policy Search. UAI 2000: 489-496
1990 – 1999
- 1999
- [j1]Leonid Peshkin, Mikhail S. Gelfand:
Segmentation of yeast DNA using hidden Markov models. Bioinform. 15(12): 980-986 (1999) - [c3]Leonid Peshkin, Nicolas Meuleau, Leslie Pack Kaelbling:
Learning Policies with External Memory. ICML 1999: 307-314 - [c2]Nicolas Meuleau, Leonid Peshkin, Kee-Eung Kim, Leslie Pack Kaelbling:
Learning Finite-State Controllers for Partially Observable Environments. UAI 1999: 427-436 - 1998
- [c1]Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, Leonid Peshkin, Leslie Pack Kaelbling, Thomas L. Dean, Craig Boutilier:
Solving Very Large Weakly Coupled Markov Decision Processes. AAAI/IAAI 1998: 165-172
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 22:56 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:
