E-LIB Suche - Ergebnisse für: Khamfroush, Hana

1

Deadline-Aware Task Offloading for Vehicular Edge Computing..:

Oza, Pratham ; Hudson, Nathaniel ; Chantem, Thidapat.
http://hdl.handle.net/10919/114863. , 2023

Link: http://hdl.handle.net/10..

2

Multimodal Multiple Federated Feature Construction Method f..:

Mahanipour, Afsaneh ; Khamfroush, Hana
http://arxiv.org/abs/2308.07131. , 2023

Link: http://arxiv.org/abs/230..

3

QoS-Aware Placement of Deep Learning Services on the Edge w..:

Hudson, Nathaniel ; Khamfroush, Hana ; Lucani, Daniel E
http://arxiv.org/abs/2104.15094. , 2021

Link: http://arxiv.org/abs/210..

4

A Modified SEIR Model for the Spread of COVID-19 Considerin..:

Ogholbake, Aram Ansary ; Khamfroush, Hana
http://arxiv.org/abs/2106.08820. , 2021

Link: http://arxiv.org/abs/210..

5

QoS-Aware Placement of Deep Learning Services on the Edge w..:

Hudson, Nathaniel ; Khamfroush, Hana ; Lucani Rötter, Daniel Enrique
Hudson , N , Khamfroush , H & Lucani Rötter , D E 2021 , QoS-Aware Placement of Deep Learning Services on the Edge with Multiple Service Implementations . in 2021 International Conference on Computer Communications and Networks (ICCCN) . IEEE , Proceedings of the International Conference on Computer Communications and Networks , 2021 International Conference on Computer Communications and Networks , 19/07/2021 . https://doi.org/10.1109/ICCCN52240.2021.9522156. , 2021

Link: https://pure.au.dk/porta..

6

Optimal Accuracy-Time Trade-off for Deep Learning Services ..:

Hosseinzadeh, Minoo ; Wachal, Andrew ; Khamfroush, Hana.
http://arxiv.org/abs/2011.08381. , 2020

Link: http://arxiv.org/abs/201..

7

Automatic Query Optimization for Retrieving Traffic Tweets:

Hufbauer, Emory ; Khamfroush, Hana
http://arxiv.org/abs/2006.11887. , 2020

Link: http://arxiv.org/abs/200..

8

Meeting QoS of Users in a Edge to Cloud Platform via Optima..:

Turner, Matthew ; Khamfroush, Hana
http://arxiv.org/abs/1908.04824. , 2019

Link: http://arxiv.org/abs/190..

9

On Fundamental Bounds of Failure Identifiability by Boolean..:

Bartolini, Novella ; He, Ting ; Arrigoni, Viviana..
http://arxiv.org/abs/1903.10636. , 2019

Link: http://arxiv.org/abs/190..

10

Smart Advertisement for Maximal Clicks in Online Social Net..:

Hudson, Nathaniel ; Khamfroush, Hana ; Harrison, Brent.
http://arxiv.org/abs/1911.02061. , 2019

Link: http://arxiv.org/abs/191..

11

Progressive damage assessment and network recovery after ma..:

CIAVARELLA, STEFANO ; BARTOLINI, NOVELLA ; Khamfroush, Hana.
info:eu-repo/semantics/altIdentifier/isbn/978-1-5090-5336-0. , 2017

Link: http://hdl.handle.net/11..

12

Fundamental limits of failure identifiability by Boolean Ne..:

Bartolini, Novella ; He, Ting ; Khamfroush, Hana
info:eu-repo/semantics/altIdentifier/wos/WOS:000425232200148. , 2017

Link: http://hdl.handle.net/11..

13

On the Coded Packet Relay Network in the Presence of Neighb..:

Khamfroush, Hana ; Pahlevani, Peyman ; Roetter, Daniel Enrique Lucani..
https://vbn.aau.dk/da/publications/ffb9cad1-fdb1-4e89-ba82-6af35ac8289b. , 2014

Link: https://vbn.aau.dk/da/pu..

14

Influence spread in two-layer interdependent networks: desi..:

Hana Khamfroush ; Nathaniel Hudson ; Samuel Iloo.
http://link.springer.com/article/10.1007/s41109-019-0150-3. , 2019

Link: https://doi.org/10.1007/..

15

Network Coding for Cooperation in Dynamic Wireless Networks:

Hana Khamfroush
https://hdl.handle.net/10216/80450. , 2014

Link: https://hdl.handle.net/1..