Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Jacopo Staiano

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 Andrey Bogomolov

> Home > Persons > Jacopo Staiano

Publications

2015
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/bigdata/BogomolovLSLOPP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bigdata/BogomolovLSLOPP15
Andrey Bogomolov, Bruno Lepri, Jacopo Staiano, Emmanuel Letouzé, Nuria Oliver, Fabio Pianesi, Alex Pentland:
Moves on the Street: Classifying Crime Hotspots Using Aggregated Anonymized Data on People Dynamics. Big Data 3(3): 148-158 (2015)
2014
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/icmi/BogomolovLSOPP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icmi/BogomolovLSOPP14
Andrey Bogomolov, Bruno Lepri, Jacopo Staiano, Nuria Oliver, Fabio Pianesi, Alex Pentland:
Once Upon a Crime: Towards Crime Prediction from Demographics and Mobile Data. ICMI 2014: 427-434
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BogomolovLSOPP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BogomolovLSOPP14
Andrey Bogomolov, Bruno Lepri, Jacopo Staiano, Nuria Oliver, Fabio Pianesi, Alex Pentland:
Once Upon a Crime: Towards Crime Prediction from Demographics and Mobile Data. CoRR abs/1409.2983 (2014)

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.