Deniz Sarioz, Ph.D.
Data Scientist at Sociocast (New York City office)
Graduate years: Completed the Ph.D. Program in Computer Science at the Graduate School and University Center of The City University of New York (CUNY) for the February 2012 degree. Dissertation: "Geometric Graph Theory and Wireless Sensor Networks." Taught over a dozen computer science courses at Hunter College and Brooklyn College. Dissertation mentor: János Pach, Chair of Combinatorial Geometry at EPFL.
My dissertation work was in the problem-solving-oriented branch of theoretical computer science and overlapped combinatorics, graph theory, discrete / combinatorial / computational geometry, discrete algorithms, and approximation algorithms. It was motivated by fundamental questions in the design and analysis of sensor networks and cellular networks. At Sociocast my interest in natural language processing has been rekindled. I have been having fun wearing the hat of an empiricist, tackling problems of a different flavor and using a wider array of tools.
During the academic year 2006-2007, I was involved in fundamentals research on the topic of arrangements in sensor networks with Professor Ted Brown and Professor Amotz Bar-Noy.
Until summer 2006, I was the graduate research assistant on a project co-advised by Distinguished Professor Gabor T. Herman and Professor T. Yung Kong. The project's aim was to develop efficient ways to obtain topological and geometric descriptors of 3D reconstructions obtained from transmission electron microscopy projections.
As a member of the Discrete Imaging and Graphics group, I have also had the pleasure of maintaining the (C++/Qt based) Snark Input and Display Utilities for 2.5 years.
Matthew P. Johnson, Deniz Sarioz, Amotz Bar-Noy, Theodore Brown, Dinesh Verma, and Chai Wah Wu, "More is more: The benefits of denser sensor deployment." Transactions on Sensor Networks 8(3), ACM, Aug 2012, 21p.
Radoslav Fulek, Noushin Saeedi, and Deniz Sarioz, "Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs." Thirty Essays in Geometric Graph Theory, Ed. J. Pach, Algorithms & Combinatorics Series, Springer. In press. Pre-print: arXiv:1104.4656 [cs.DM], 11p., 6 figures, Sep 2011.
Deniz Sarioz, "Approximating the obstacle number for a graph drawing efficiently." Proc. 23rd Canadian Conference on Computational Geometry (CCCG '11), Toronto, ON, Canada, Aug 2011, 6p. Delivered oral presentation.
János Pach and Deniz Sarioz, "On the structure of graphs with low obstacle number." Graphs and Combinatorics 27(3), Springer, May 2011, pp. 465-473. Available at www.springerlink.com.
Padmini Mukkamala, János Pach, and Deniz Sarioz, "Graphs with large obstacle numbers." 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG '10), Zaros, Crete, Greece, Jun 2010. In Lecture Notes in Computer Science (LNCS) 6410, Springer, 2010, pp. 292-303. The original publication is available at www.springerlink.com. Delivered oral presentation.
Matthew Johnson, Amotz Bar-Noy, Chai Wu, Deniz Sarioz, Theodore Brown, and Dinesh Verma, "More is more: the benefits of denser sensor deployment." 28th IEEE International Conference on Computer Communications (INFOCOM '09), Rio de Janeiro, Brazil, Apr 2009, pp. 379-387. Accepted to main conference.
Matthew Johnson, Chai Wah Wu, Amotz Bar-Noy, Theodore Brown, Deniz Sarioz, and Dinesh Verma, "More is more: the benefits of dense sensor deployment." Fifth IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS '08), Atlanta, GA, Sep-Oct 2008, pp. 514-515.
Ted Brown, Deniz Sarioz, Amotz Bar-Noy, Tom LaPorta and Dinesh Verma, "Coverage of a region allowing inexact placement of sensors." First Annual Conference of Information Technology Alliance (ACITA '07), Adelphi, MD, Sep 2007, 7p. Delivered oral presentation.
Ted Brown, Deniz Sarioz, Amotz Bar-Noy, Tom LaPorta, Dinesh Verma, Matthew Johnson and Hosam Rowaihy, "Geometric considerations for distribution of sensors in ad-hoc sensor networks." Defense and Security Symposium 2007 (DSS '07), Proc. SPIE 6562, Unattended Ground, Sea, and Air Sensor Technologies and Applications IX, Orlando, FL, pp. 65620U, Apr 2007. Delivered oral presentation.
Deniz Sarioz, T. Yung Kong and Gabor T. Herman, "History trees as descriptors of macromolecular structures." Proc. 2nd International Symposium on Visual Computing (ISVC '06), Lake Tahoe, NV, Nov 2006. In Lecture Notes in Computer Science (LNCS) 4291, Springer, 2006, pp. 263-272. Delivered oral presentation.
Deniz Sarioz, Gabor T. Herman and T. Yung Kong, "A technology for retrieval of volume images from biomedical databases." Proc. 30th IEEE/EMB Annual Northeast Bioengineering Conference, Springfield, MA, CD-ROM, pp. 67-68, Apr 2004. Delivered oral presentation.
Matthew P. Johnson and Deniz Sarioz, "Computing the obstacle number of a plane graph." arXiv:1107.4624 [cs.CG], 7p., Jul 2011.
János Pach and Deniz Sarioz, "Small (2,s)-colorable graphs without 1-obstacle representations." arXiv:1012.5907 [cs.DM], 14p., 13 figures, Apr 2011.
Deniz Sarioz, "Generalized Delaunay graphs with respect to any convex set are plane graphs." arXiv:1012.4881 [cs.CG], 3p., Dec 2010.
J. L. Ambite, Y. Arens, L. Gravano, V. Hatzivassiloglou, E. H. Hovy, J. L. Klavans, A. Philpot, U. Ramachandran, K. Ross, J. Sandhaus, D. Sarioz, A. Singla, and B. Whitman, "Data Integration and Access: The Digital Government Research Centers Energy Data Collection (EDC) Project." Advances in Digital Government, Dordrecht, Kluwer, 2002, pp. 85-106.
Deniz Sarioz and Victor Dan, "The expected shortest path problem: algorithms and experiments." Journal of Computing Sciences in Colleges 16(4), Middlebury, VT, CCSC, 2001, pp. 311-312.
|Contact me: (sariozc acmrcorg)|