635 citations
- Texas A&M UniversityUS6 papers
- University of Wisconsin–OshkoshUS6 papers
- Universidad Nacional Autónoma de MéxicoMX4 papers
- Centro de Investigación y de Estudios Avanzados del Instituto Politécnico NacionalMX3 papers
- Universidad de CádizES2 papers
- Yantai UniversityCN2 papers
- Benemérita Universidad Autónoma de PueblaMX1 paper
- Centro Universitário InternacionalMX1 paper
- Middle Tennessee State UniversityUS1 paper
- Monash UniversityAU1 paper
- Naval Postgraduate SchoolUS1 paper
- NED University of Engineering and TechnologyPK1 paper
33 papers
ELEV-VISION: Automated Lowest Floor Elevation Estimation from Segmenting Street View Images
Yu-Hsuan Ho, Cheng-Chun Lee, Nicholas D. Diaz +2
We propose an automated lowest floor elevation (LFE) estimation algorithm based on computer vision techniques to leverage the latent information in street view images. Flood depth-…
Predicting Road Flooding Risk with Machine Learning Approaches Using Crowdsourced Reports and Fine-grained Traffic Data
Faxi Yuan, William Mobley, Hamed Farahmand +5
The objective of this study is to predict road flooding risks based on topographic, hydrologic, and temporal precipitation features using machine learning models. Predictive flood…
The fractional -truncated metric dimension of graphs
Eunjeong Yi
The metric dimension, , and the fractional metric dimension, , of a graph have been studied extensively. Let be a graph with vertex set , and let…
A Sequential Supervised Machine Learning Approach for Cyber Attack Detection in a Smart Grid System
Yasir Ali Farrukh, Irfan Khan, Zeeshan Ahmad +1
Modern smart grid systems are heavily dependent on Information and Communication Technology, and this dependency makes them prone to cyberattacks. The occurrence of a cyberattack h…
The distance-k dimension of graphs
Jesse Geneson, Eunjeong Yi
The metric dimension, , of a graph is a graph parameter motivated by robot navigation that has been studied extensively. Let be a graph with vertex set , and…
Distance- locating-dominating sets in graphs
Cong X. Kang, Eunjeong Yi
Let be a graph with vertex set , and let be a positive integer. A set is a \emph{distance- dominating set} of if, for each vertex , the…