Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Alka Bhushan"'
Publikováno v:
COMSNETS
We develop a distributed learning simulation platform that allows users to create multi-level Edge hierarchy for a given application by simulating resource constrained Edge devices and communication links amongst them. The resulting Edge computing hi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb7bdb5d80744e83420199b7f55f90e5
https://doi.org/10.1109/comsnets48256.2020.9027386
https://doi.org/10.1109/comsnets48256.2020.9027386
Autor:
Nandlal L. Sarda, Alka Bhushan
Publikováno v:
Geospatial Infrastructure, Applications and Technologies: India Case Studies ISBN: 9789811323294
Making efficient evacuation plans for large buildings is an important task in operating a large building infrastructure. The plans require a capacitated building network, well-defined exit points, and expected occupancy of a building to analyze evacu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6bfbec3a028d060063b95b9db6bdc912
https://doi.org/10.1007/978-981-13-2330-0_9
https://doi.org/10.1007/978-981-13-2330-0_9
Autor:
Alka Bhushan, Umesh Bellur
Publikováno v:
Geospatial Infrastructure, Applications and Technologies: India Case Studies ISBN: 9789811323294
Current methods for mining groups from moving object data work with entire data stream. However, there are several emerging applications such as traffic management and urban emergency response systems which often need to identify groups from recent w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd33c7fe0a2936c5fb8e0dafddbf6ac5
https://doi.org/10.1007/978-981-13-2330-0_20
https://doi.org/10.1007/978-981-13-2330-0_20
Publikováno v:
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Vol II-4/W2, Pp 67-71 (2015)
In this paper, we address outliers in spatiotemporal data streams obtained from sensors placed across geographically distributed locations. Outliers may appear in such sensor data due to various reasons such as instrumental error and environmental ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a4019718972d81249828525a5597169
https://doi.org/10.5194/isprsannals-ii-4-w2-67-2015
https://doi.org/10.5194/isprsannals-ii-4-w2-67-2015
Autor:
Alka Bhushan, G. Sajith
Publikováno v:
Theoretical Computer Science. 575:33-41
The problem of finding the minimum cut of an undirected unweighted graph is studied on the external memory model. First, a lower bound of Ω((E/V) Sort(V)) on the number of I/Os is shown for the problem, where V is the number of vertices and E is the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16bf3291357659f6f14c3f835bae7e1a
https://doi.org/10.1016/j.tcs.2014.10.043
https://doi.org/10.1016/j.tcs.2014.10.043
Publikováno v:
SIGSPATIAL/GIS
Several emerging applications such as traffic management and urban emergency response systems often need to identify groups from recent window of the moving object data. These requirements mandate algorithmic solutions that are time and memory effici
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be6cddb4b98d0136494ea048412f6795
https://doi.org/10.1145/3139958.3139988
https://doi.org/10.1145/3139958.3139988
Autor:
Alka Bhushan, Nandlal L. Sarda
Publikováno v:
Fire Safety Journal. 55:126-138
Existing research and tools used for building evacuation planning do not take into account the common practice of using ladders for rescue operations. The ladders provide a simple and practical way of creating additional exits with a potential to sig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68b9f8aad63f1c308d8eebad77400ac6
https://doi.org/10.1016/j.firesaf.2012.10.021
https://doi.org/10.1016/j.firesaf.2012.10.021
Publikováno v:
EM-GIS
This paper focuses on indoor evacuation path planning problem where the objective is to find evacuation paths for each evacuee such that the evacuation egress time is minimized. Since paths are dependent on the distribution of evacuees, initial posit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13d5650f40bb0cdc35c135e1b993e7c2
https://doi.org/10.1145/2835596.2835597
https://doi.org/10.1145/2835596.2835597
Autor:
Alka Bhushan, G. Sajith
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783319266251
COCOA
COCOA
An $$O\mathrm{Sort}E\cdot \log \log _{E/V} B$$OSortEi¾?loglogE/VB I/Os algorithm for computing a minimum spanning tree of a graph $$G=V,E$$G=V,E is presented, where $$\mathrm{Sort}E=E/B\log _{M/B}E/B$$SortE=E/BlogM/BE/B, M is the main memory size, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4fee781e9d980fec6391c349be482c2d
https://doi.org/10.1007/978-3-319-26626-8_36
https://doi.org/10.1007/978-3-319-26626-8_36
Autor:
Alka Bhushan, G. Sajith
Publikováno v:
Algorithms and Computation ISBN: 9783319046563
WALCOM
WALCOM
The problem of finding the minimum cut of an undirected unweighted graph is studied on the external memory model. First, a lower bound of Ω((E/V) Sort(V)) on the number of I/Os is shown for the problem, where V is the number of vertices and E is the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63c30198d4cfa5cd2208ff5d1051dea9
https://doi.org/10.1007/978-3-319-04657-0_19
https://doi.org/10.1007/978-3-319-04657-0_19