-
1
-
-
84902006232
-
-
Transportation for America: Surface Transportation Policy Partnership, Washington, DC
-
Ernst, M., Lang, M., Davis, S.: Dangerous by design: Solving the epidemic of preventable pedestrian deaths. Transportation for America: Surface Transportation Policy Partnership, Washington, DC (2011)
-
(2011)
Dangerous by design: Solving the epidemic of preventable pedestrian deaths
-
-
Ernst, M.1
Lang, M.2
Davis, S.3
-
5
-
-
33947381826
-
Multivariate scan statistics for disease surveillance
-
Kulldorff, M., Mostashari, F., Duczmal, L., Katherine Yih, W., Kleinman, K., Platt, R.: Multivariate scan statistics for disease surveillance. Statistics in Medicine 26(8), 1824–1833 (2007)
-
(2007)
Statistics in Medicine
, vol.26
, Issue.8
, pp. 1824-1833
-
-
Kulldorff, M.1
Mostashari, F.2
Duczmal, L.3
Katherine Yih, W.4
Kleinman, K.5
Platt, R.6
-
6
-
-
0001822539
-
Spatial scan statistics: Models, calculations, and applications
-
Springer
-
Kulldorff, M.: Spatial scan statistics: Models, calculations, and applications. In: Scan Statistics and Applications, pp. 303–322. Springer (1999)
-
(1999)
Scan Statistics and Applications
, pp. 303-322
-
-
Kulldorff, M.1
-
7
-
-
84857641333
-
Constrained spanning tree algorithms for irregularly-shaped spatial clustering
-
Costa, M.A., Assunção, R.M., Kulldorff, M.: Constrained spanning tree algorithms for irregularly-shaped spatial clustering. Computational Statistics & Data Analysis 56(6), 1771–1783 (2012)
-
(2012)
Computational Statistics & Data Analysis
, vol.56
, Issue.6
, pp. 1771-1783
-
-
Costa, M.A.1
Assunção, R.M.2
Kulldorff, M.3
-
8
-
-
1142280371
-
A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters
-
Duczmal, L., Assuncao, R.: A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters. Computational Statistics & Data Analysis 45(2), 269–286 (2004)
-
(2004)
Computational Statistics & Data Analysis
, vol.45
, Issue.2
, pp. 269-286
-
-
Duczmal, L.1
Assuncao, R.2
-
11
-
-
37849006890
-
Traffic density-based discovery of hot routes in road networks
-
In: Papadias, D., Zhang, D., Kollios, G. (eds.), Springer, Heidelberg
-
Li, X., Han, J., Lee, J.-G., Gonzalez, H.: Traffic density-based discovery of hot routes in road networks. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 441–459. Springer, Heidelberg (2007)
-
(2007)
SSTD 2007. LNCS
, vol.4605
, pp. 441-459
-
-
Li, X.1
Han, J.2
Lee, J.-G.3
Gonzalez, H.4
-
12
-
-
85170282443
-
A density-based algorithm for discovering clusters in large spatial databases with noise
-
Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, vol. 96, pp. 226–231 (1996)
-
(1996)
KDD
, vol.96
, pp. 226-231
-
-
Ester, M.1
Kriegel, H.P.2
Sander, J.3
Xu, X.4
-
14
-
-
79951743081
-
A K-Main Routes Approach to Spatial Network Activity Summarization: A Summary of Results
-
Oliver, D., Bannur, A., Kang, J.M., Shekhar, S., Bousselaire, R.: A K-Main Routes Approach to Spatial Network Activity Summarization: A Summary of Results. In: IEEE International Conference on Data Mining Workshops (ICDMW), pp. 265–272 (2010)
-
(2010)
IEEE International Conference on Data Mining Workshops (ICDMW)
, pp. 265-272
-
-
Oliver, D.1
Bannur, A.2
Kang, J.M.3
Shekhar, S.4
Bousselaire, R.5
-
15
-
-
84910650252
-
Finding the most relevant fragments in networks
-
Buchin, K., Cabello, S., Gudmundsson, J., Löffler, M., Luo, J., Rote, G., Silveira, R.I., Speckmann, B., Wolle, T.: Finding the most relevant fragments in networks. J. Graph Algorithms Appl. 14(2), 307–336 (2010)
-
(2010)
J. Graph Algorithms Appl
, vol.14
, Issue.2
, pp. 307-336
-
-
Buchin, K.1
Cabello, S.2
Gudmundsson, J.3
Löffler, M.4
Luo, J.5
Rote, G.6
Silveira, R.I.7
Speckmann, B.8
Wolle, T.9
-
16
-
-
33750044851
-
Single-source stochastic routing
-
In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.), Springer, Heidelberg
-
Chawla, S., Roughgarden, T.: Single-source stochastic routing. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX/RANDOM 2006. LNCS, vol. 4110, pp. 82–94. Springer, Heidelberg (2006)
-
(2006)
APPROX/RANDOM 2006. LNCS
, vol.4110
, pp. 82-94
-
-
Chawla, S.1
Roughgarden, T.2
-
17
-
-
0030734554
-
CCAM: A connectivity-clustered access method for networks and network computations
-
Shekhar, S., Liu, D.: CCAM: A connectivity-clustered access method for networks and network computations. IEEE Transactions on Knowledge and Data Engineering 9(1), 102–119 (1997)
-
(1997)
IEEE Transactions on Knowledge and Data Engineering
, vol.9
, Issue.1
, pp. 102-119
-
-
Shekhar, S.1
Liu, D.2
-
19
-
-
0003394436
-
-
National Cancer Institute, Bethesda
-
Kulldorff, M., Rand, K., Gherman, G., Williams, G., DeFrancesco, D.: SaTScan v 2.1: Software for the spatial and space-time scan statistics. National Cancer Institute, Bethesda (1998)
-
(1998)
SaTScan v 2.1: Software for the spatial and space-time scan statistics
-
-
Kulldorff, M.1
Rand, K.2
Gherman, G.3
Williams, G.4
Defrancesco, D.5
-
20
-
-
84921371884
-
-
accessed: January 23
-
The QGIS Project: Quantum GIS OpenLayers Plugin, http://plugins.qgis.org/plugins/openlayers_plugin/ (accessed: January 23, 2014)
-
(2014)
Quantum GIS OpenLayers Plugin
-
-
-
21
-
-
84921361501
-
-
accessed: January 23
-
US Census Bureau: Census TIGER/Line Shapefiles (2010), http://www.census.gov/geo/maps-data/data/tiger-line.html (accessed: January 23, 2014)
-
(2014)
Census TIGER/Line Shapefiles (2010)
-
-
|