Ovidiu Daescu

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 42

Top Venues

Publications

Ankur Yadav, Ovidiu Daescu
Optimizing Foundation Models for Histopathology: A Continual Learning Approach to Cancer Detection. TAI4H (2024)
Ankur Yadav, Ovidiu Daescu, Zachary Sickmann
From Topological Signatures to Textural Patterns: Enhancing the Precision of Sand Classification. SSIAI (2024)
Ankur Yadav, Ovidiu Daescu, Patrick Leavey, Erin R. Rudzinski
Machine Learning for Rhabdomyosarcoma Whole Slide Images Sub-type Classification. PETRA (2023)
Ovidiu Daescu, Ka Yaw Teo
Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. CCCG (2023)
Ankur Yadav, Faisal Ahmed, Ovidiu Daescu, Reyhan Gedik, Baris Coskunuzer
Histopathological Cancer Detection with Topological Signatures. BIBM (2023)
Ovidiu Daescu, Ka Yaw Teo
. CCCG (2022)
Ovidiu Daescu, Ka Yaw Teo
Approximating the discrete and continuous median line segments in d dimensions. CoRR (2022)
Ovidiu Daescu, Ka Yaw Teo
The Median Line Segment Problem: Computational Complexity and Constrained Variants. CCCG (2022)
Ovidiu Daescu, Hemant Malik
New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision. Theor. Comput. Sci. 882 (2021)
Saloni Agarwal, Mohamedelfatih Eltigani Osman Abaker, Ovidiu Daescu
Survival Prediction Based on Histopathology Imaging and Clinical Data: A Novel, Whole Slide CNN Approach. MICCAI (5) (2021)
Ovidiu Daescu, Ka Yaw Teo
The Discrete Median and Center Line Segment Problems in the Plane. CCCG (2021)
Ovidiu Daescu, Ka Yaw Teo
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment. Comput. Geom. 96 (2021)
Saloni Agarwal, Mohamedelfatih Eltigani Osman Abaker, Xinyi Zhang, Ovidiu Daescu, Donald A. Barkauskas, Erin R. Rudzinski, Patrick Leavey
Rhabdomyosarcoma Histology Classification using Ensemble of Deep Learning Networks. BCB (2020)
Ovidiu Daescu, Hemant Malik
Guarding Disjoint Orthogonal Polygons in the Plane. COCOA (2020)
Ovidiu Daescu, Ka Yaw Teo
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CoRR (2020)
Ka Yaw Teo, Ovidiu Daescu, Kyle Fox
Trajectory planning for an articulated probe. Comput. Geom. 90 (2020)
Ovidiu Daescu, Ka Yaw Teo
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CoRR (2020)
Ovidiu Daescu, Hemant Malik
City Guarding with Limited Field of View. CoRR (2020)
Ovidiu Daescu, Hemant Malik
City Guarding with Limited Field of View. CCCG (2020)
Ovidiu Daescu, Ka Yaw Teo
Two-dimensional closest pair problem: A closer look. Discret. Appl. Math. 287 (2020)
Ovidiu Daescu, Ka Yaw Teo
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CCCG (2020)
Bogdan Armaselu, Ovidiu Daescu
Dynamic minimum bichromatic separating circle. Theor. Comput. Sci. 774 (2019)
Ovidiu Daescu, Hemant Malik
k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler. SEA² (2019)
Ovidiu Daescu, Stephan Friedrichs, Hemant Malik, Valentin Polishchuk, Christiane Schmidt
Altitude terrain guarding and guarding uni-monotone polygons. Comput. Geom. 84 (2019)
Ovidiu Daescu, Ka Yaw Teo
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CCCG (2019)
Ovidiu Daescu, Hongyao Huang, Maxwell A. Weinzierl
Deep learning based face recognition system with smart glasses. PETRA (2019)
Ovidiu Daescu, Ka Yaw Teo
Improved line facility location in weighted subdivisions. IWISC (2018)
Saloni Agarwal, Rami R. Hallac, Rashika Mishra, Chao Li, Ovidiu Daescu, Alex A. Kane
Image Based Detection of Craniofacial Abnormalities using Feature Extraction by Classical Convolutional Neural Network. ICCABS (2018)
Ovidiu Daescu, Hemant Malik
Does a Robot Path Have Clearance C? COCOA (2018)
Ovidiu Daescu, Kyle Fox, Ka Yaw Teo
Trajectory Planning for an Articulated Probe. CCCG (2018)
Hemant Malik, Ovidiu Daescu
k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler. CoRR (2018)
Ovidiu Daescu, Hemant Malik
Does a robot path have clearance c? CoRR (2018)
Rashika Mishra, Ovidiu Daescu, Patrick Leavey, Dinesh Rakheja, Anita Sengupta
Convolutional Neural Network for Histopathological Analysis of Osteosarcoma. J. Comput. Biol. 25 (3) (2018)
Harish Babu Arunachalam, Rashika Mishra, Bogdan Armaselu, Ovidiu Daescu, Maria Martinez, Patrick Leavey, Dinesh Rakheja, Kevin Cederberg, Anita Sengupta, Molly Ni'suilleabhain
Computer Aided Image Segmentation and Classification for Viable and Non-Viable Tumor Identification in Osteosarcoma. PSB (2017)
Rashika Mishra, Ovidiu Daescu
Deep learning for skin lesion segmentation. BIBM (2017)
Bogdan Armaselu, Ovidiu Daescu
Maximum Area Rectangle Separating Red and Blue Points. CoRR (2017)
Rashika Mishra, Ovidiu Daescu, Patrick Leavey, Dinesh Rakheja, Anita Sengupta
Histopathological Diagnosis for Viable and Non-viable Tumor Prediction for Osteosarcoma Using Convolutional Neural Network. ISBRA (2017)
Ovidiu Daescu, Ka Yaw Teo
2D Closest Pair Problem: A Closer Look. CCCG (2017)
Bogdan Armaselu, Ovidiu Daescu
Interactive Assistive Framework for Maximum Profit Routing in Public Transportation in Smart Cities. PETRA (2017)
Bogdan Armaselu, Ovidiu Daescu
Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper. PETRA (2016)
Bogdan Armaselu, Ovidiu Daescu
Maximum Area Rectangle Separating Red and Blue Points. CCCG (2016)
Bogdan Armaselu, Ovidiu Daescu
Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint. CoRR (2016)
Sergey Bereg, Ovidiu Daescu, Marko Zivanic, Timothy Rozario
Smallest Maximum-Weight Circle for Weighted Points in the Plane. ICCSA (2) (2015)
Bogdan Armaselu, Ovidiu Daescu
Algorithms for fair partitioning of convex polygons. Theor. Comput. Sci. 607 (2015)
Bogdan Armaselu, Harish Babu Arunachalam, Ovidiu Daescu, John-Paul Bach, Kevin Cederberg, Dinesh Rakheja, Anita Sengupta, Stephen Skapek, Patrick Leavey
Whole slide images stitching for osteosarcoma detection. ICCABS (2015)
Bogdan Armaselu, Ovidiu Daescu
Dynamic Minimum Bichromatic Separating Circle. COCOA (2015)
David Allen, Ovidiu Daescu
Improving healthcare cost transparency through mobile application development. PETRA (2014)
David Allen, Ovidiu Daescu
Optimization of IMRT treatment plan with Kinetic Data Structures. ICCABS (2014)
Bogdan Armaselu, Ovidiu Daescu
Algorithms for Fair Partitioning of Convex Polygons. COCOA (2014)
Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu, Ovidiu Daescu
On some geometric problems of color-spanning sets. J. Comb. Optim. 26 (2) (2013)
David Allen, Ovidiu Daescu
A comprehensive system for locating medical services. PETRA (2013)
Wenqi Ju, Jun Luo, Binhai Zhu, Ovidiu Daescu
Largest area convex hull of imprecise data based on axis-aligned squares. J. Comb. Optim. 26 (4) (2013)
David Allen, Ovidiu Daescu
Radiation therapy simulation and optimization using kinetic polygon modeling. IRI (2013)
Marko Zivanic, Ovidiu Daescu, Anastasia Kurdia, S. R. Goodman
The Voronoi diagram for graphs and its application in the Sickle Cell Disease research. J. Comput. Sci. 3 (5) (2012)
Steven Bitner, Ovidiu Daescu
. Comput. Geom. 45 (9) (2012)
Weili Wu, Ovidiu Daescu
Preface. Theor. Comput. Sci. 447 (2012)
Yam Ki Cheung, Ovidiu Daescu, J. Steven Kirtzic, Lech Papiez
Volume matching with application in medical treatment planning. ICCABS (2012)
Yam Ki Cheung, Ovidiu Daescu, Marko Zivanic
Kinetic Red-Blue Minimum Separating Circle. COCOA (2011)
Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu
Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data. COCOON (2011)
Yam Ki Cheung, Ovidiu Daescu, Lech Papiez
Volume matching with application in medical treatment planning. BCB (2011)
J. Steven Kirtzic, Ovidiu Daescu
Face It: 3D Facial Reconstruction from a Single 2D Image for Games and Simulations. CW (2011)
Marko Zivanic, Ovidiu Daescu, Anastasia Kurdia
Rigid region pairwise sequence alignment. BIBM Workshops (2011)
Yam Ki Cheung, Ovidiu Daescu
Line facility location in weighted regions. J. Comb. Optim. 22 (1) (2011)
Sairam Behera, Ovidiu Daescu, Lech Papiez
Optimal delivery of volumetric modulated arc therapy (VMAT) for moving target. BIBM Workshops (2011)
Yam Ki Cheung, Ovidiu Daescu
Approximate Point-to-Face Shortest Paths in R^3 CoRR (2010)
Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk
Visiting a Sequence of Points with a Bevel-Tip Needle. LATIN (2010)
Steven Bitner, Ovidiu Daescu
Minimum Sum Dipolar Spanning Tree in R^3 CoRR (2010)
Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu
Guarding a Terrain by Two Watchtowers. Algorithmica 58 (2) (2010)
Yam Ki Cheung, Ovidiu Daescu
FréChet Distance Problems in Weighted Regions. Discret. Math. Algorithms Appl. 2 (2) (2010)
Steven Bitner, Yam Ki Cheung, Ovidiu Daescu
Minimum Separating Circle for Bichromatic Points in the Plane. ISVD (2010)
Robert Finis Anderson, J. Steven Kirtzic, Ovidiu Daescu
Applying Parallel Design Techniques to Template Matching with GPUs. VECPAR (2010)
Ovidiu Daescu, Wenqi Ju, Jun Luo
NP-Completeness of Spreading Colored Points. COCOA (1) (2010)
Yam Ki Cheung, Ovidiu Daescu
Fréchet Distance Problems in Weighted Regions CoRR (2010)
Ovidiu Daescu, Anastasia Kurdia
Towards an optimal algorithm for recognizing Laman graphs. J. Graph Algorithms Appl. 13 (2) (2009)
Steven Bitner, Ovidiu Daescu
. Inf. Process. Lett. 109 (20) (2009)
Ovidiu Daescu, Anastasia Kurdia
Towards an Optimal Algorithm for Recognizing Laman Graphs. HICSS (2009)
Ovidiu Daescu, James D. Palmer
Minimum Separation in Weighted Subdivisions. Int. J. Comput. Geom. Appl. 19 (1) (2009)
Ovidiu Daescu, Anastasia Kurdia
Polygonal chain simplification for flight simulation systems. SpringSim (2009)
Ovidiu Daescu, Yam Ki Cheung, James D. Palmer
Parallel Optimal Weighted Links. Trans. Comput. Sci. 3 (2009)
Sergey Bereg, Ovidiu Daescu, Minghui Jiang
A PTAS for Cutting Out Polygons with Lines. Algorithmica 53 (2) (2009)
Yam Ki Cheung, Ovidiu Daescu
Fréchet Distance Problems in Weighted Regions. ISAAC (2009)
Ovidiu Daescu, Jun Luo
Stabbing balls and simplifying proteins. Int. J. Bioinform. Res. Appl. 5 (1) (2009)
Yam Ki Cheung, Ovidiu Daescu
Line Segment Facility Location in Weighted Subdivisions. AAIM (2009)
Ovidiu Daescu, Anastasia Kurdia
Polygonal Chain Simplification with Small Angle Constraints. CCCG (2008)
Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou
On Some City Guarding Problems. COCOON (2008)
Yam Ki Cheung, Ovidiu Daescu
Line Facility Location in Weighted Regions. AAIM (2008)
Steven Bitner, Ovidiu Daescu
Finding a Minimum-Sum Dipolar Spanning Tree in R3. HICSS (2008)
Yam Ki Cheung, Ovidiu Daescu, Anastasia Kurdia
A New Modeling for Finding Optimal Weighted Distances. BIOTECHNO (2008)
Steven Bitner, Ovidiu Daescu
. CCCG (2007)
Ovidiu Daescu, Jun Luo
Computing Simple Paths on Points in Simple Polygons. KyotoCGGT (2007)
Steven Bitner, Ovidiu Daescu
. CCCG (2007)
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
An Experimental Study of Weighted k-Link Shortest Path Algorithms. WAFR (2006)
Ovidiu Daescu, James D. Palmer
Finding optimal weighted bridges with applications. ACM Southeast Regional Conference (2006)
Sergey Bereg, Ovidiu Daescu, Minghui Jiang
A PTAS for Cutting Out Polygons with Lines. COCOON (2006)
Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi
Load-balanced agent activation for value-added network services. Comput. Commun. 29 (11) (2006)
Ovidiu Daescu, Jun Luo, David M. Mount
Proximity problems on line segments spanned by points. Comput. Geom. 33 (3) (2006)
Ovidiu Daescu, Gheorghe Fasui, Karthik Haridoss
GARA: a geometry aided routing algorithm. Wirel. Commun. Mob. Comput. 6 (2006)
Ovidiu Daescu, Jun Luo
Cutting out Polygons with Lines and Rays. Int. J. Comput. Geom. Appl. 16 (2-3) (2006)
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
Farthest-point queries with geometric and combinatorial constraints. Comput. Geom. 33 (3) (2006)
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. SCG (2006)

Ovidiu Daescu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ovidiu Daescu