Please type your desired tags, e.g. auditory, skepticism, Methods/Software Development, Hydrogeology, narcissism, ChIP-seq, Plasma, short pulse fiber lasers, integral equations, eyetracking, and etc.
Press the 'enter' key or type a comma (,) after each new tag.
Ph.D. - Computer Science and Engineering University of Notre Dame - 2000
M.S. - Computer Science and Engineering University of Notre Dame - 1997
Engineer Diploma - Computer Science and Automation Technical Military Academy (Burhest, Romania) - 1991
Algorithms and Optimization
Statement of Research:
My main research interests are in the areas of geometric computing, bio-medical computing, parallel (multicore, GPU) computing, and intelligent transportation systems. I am particularly interested in developing computationally efficient algorithms for optimization problems. Some of the emerging computational fields, such as computational medicine and intelligent transportation are dealing with problems that can make use of geometric and graph optimization techniques. My research aims to bring computational geometry and geometric optimization methods to the forefront of other computational fields.
David Allen, Ovidiu Daescu: A comprehensive system for locating medical services. PETRA 2013: 31 2013 - Publication
David Allen, Ovidiu Daescu: Radiation therapy simulation and optimization using kinetic polygon modeling. IRI 2013: 239-246 2013 - Publication
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): 832-859 (2013) 2013 - Publication
Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu, Ovidiu Daescu: On some geometric problems of color-spanning sets. J. Comb. Optim. 26(2): 266-283 (2013) 2013 - Publication
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. Science 3(5): 335-343 (2012) 2012 - Publication
Computer scientists at UT Dallas hope that funding awarded by the National Science Foundation to create an Industry/University Cooperative Research Center will help the Dallas area become a research hub for technology that enhances human abilities.
Like all I/UCRCs, the iPerform Center for Assistive Technologies to Enhance Human Performancesupports research that interests university and industry members. The center originated with two sites, one at UT Dallas and the other at the University of Texas at Arlington. The NSF awarded UT Dallas $325,000 for five years to create iPerform, with the expectation that researchers involved would attract industry partners that pay a fee to fund precompetitive research and have access to other research at the center. Researchers at UT Arlington have received separate funding to participate in iPerform and also are attracting partners.
Weighted Region Problems: Theory and Algorithms
$249,996 - NSF [2006–2010]
Outlier Identification and Handling in Computational Geometry Problems
$99,972 - NSF [2004–2006]
Algorithms for Computing Optimal Weighted Links and Trajectories
$14,000 - Clark Foundation Research Initiation Grants Program (through UTD) [2002–2002]
Resources for Research in Scalable Parallel Computing and Networking Simulation