A METHOD FOR DESIGNING THE DOUBLE-DENSITY DUAL-TREE DISCRETE WAVELET TRANSFORM Bogdan Dumitrescu, Ali Bahrami Rad Department of Signal Processing Tampere University of Technology P.O.Box 553, 33101 Tampere, FINLAND

Source URL: ticsp.cs.tut.fi

ANNA-MARIA DUMITRESCU, Gradinita de copii Scortaru-Vechi(Scoala Tudor Vladimirescu), Romania Linda Giannini, Scuola Infanzia Istituto Comprensivo Don Milani Latina rif. ins Linda Giannini, Italia hanno ricevuto il Certif

Source URL: www.descrittiva.it

a r t e O art\ a contrariilor umitru Ivan s-a n\scut în anul 1938, la Timi[oara. Î[i începe studiile artistice la Cluj, cu Petru Feher, [i le continu\ la Bucure[ti cu Petre Dumitrescu [i Florin Mitroi. Biologic, dar

Source URL: www.romlit.ro

On two lower bound constructions Adrian Dumitrescu Computer Science, Rutgers University e-mail: Abstract

Source URL: www.cccg.ca

• Crossing number
• Ordinal numbers
• Set theory
• Symbol
• Mathematics
• Mathematical logic
• Tree

16th Canadian Conference on Computational Geometry, 2004 ˝ A remark on the Erdos–Szekeres theorem Adrian Dumitrescu

Source URL: www.cccg.ca

• Discrete geometry
• Convex analysis
• Euclidean plane geometry
• Ramsey theory
• Convex hull
• Convex set
• Polygon
• Happy Ending problem
• Convex function
• Geometry
• Mathematics
• Convex geometry

16th Canadian Conference on Computational Geometry, 2004 On some monotone path problems in line arrangements Adrian Dumitrescu


Source URL: www.cccg.ca

• Arrangement of lines
• Discrete geometry
• Euclidean plane geometry
• Monotone polygon
• Convex function
• Monotonic function
• Mathematical analysis
• Geometry
• Mathematics

CCCG 2010, Winnipeg MB, August 9–11, 2010 The traveling salesman problem for lines and rays in the plane Adrian Dumitrescu∗ Abstract

Source URL: cccg.ca

• Operations research
• NP-complete problems
• Computational complexity theory
• Travelling salesman problem
• Approximation algorithm
• Linear programming
• Algorithm
• Polygon
• Theoretical computer science
• Mathematics
• Applied mathematics

CCCG 2010, Winnipeg MB, August 9–11, 2010 Watchman tours for polygons with holes Adrian Dumitrescu∗ Abstract. A watchman tour in a polygonal domain (for

Source URL: cccg.ca

• Theoretical computer science
• Computational geometry
• Euclidean plane geometry
• Simple polygon
• Art gallery problem
• Polygon
• Travelling salesman problem
• Induced path
• Geometry
• Mathematics
• Polygons

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 On distinct distances among points in general position and other related problems Adrian Dumitrescu∗

Source URL: cccg.ca

• Mathematical analysis
• Complex number
• Big O notation
• Lattice
• Erdős distinct distances problem
• Geometry
• Mathematics
• Discrete geometry

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 On Fence Patrolling by Mobile Agents Ke Chen∗ Adrian Dumitrescu†

Source URL: www.cccg.ca

• Chemical warfare
• A1