Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Pietro De Camilli

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with Derek Toomre

> Home > Persons > Pietro De Camilli

Publications

2012
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/isbi/LiangSXCTD12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isbi/LiangSXCTD12
Liang Liang, Hongying Shen, Yingke Xu, Pietro De Camilli, Derek Toomre, James S. Duncan:
A Bayesian method for 3D estimation of subcellular particle features in multi-angle TIRF microscopy. ISBI 2012: 984-987
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/mmbia/LiangXSCTD12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mmbia/LiangXSCTD12
Liang Liang, Yingke Xu, Hongying Shen, Pietro De Camilli, Derek K. Toomre, James S. Duncan:
Automatic detection of subcellular particles in fluorescence microscopy via feature clustering and bayesian analysis. MMBIA 2012: 161-166
2011
[c2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/miccai/LiangSCTD11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/miccai/LiangSCTD11
Liang Liang, Hongying Shen, Pietro De Camilli, Derek Toomre, James S. Duncan:
An Expectation Maximization Based Method for Subcellular Particle Tracking Using Multi-angle TIRF Microscopy. MICCAI (1) 2011: 629-636

a service of

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.