Philippe Canalda
Publication Count: 1
Publication List:
(1) Geometric and Signal Strength Dilution of Precision (DoP) Wi-Fi, Volume 3, August 2009
About Philippe Canalda:
Dr Philippe Canalda got M.Sc. and Ph.D. Degrees in computer science from the University of OrlŽans (France) in 1991 and 1997, respectively. He worked at INRIA Rocquencourt from 1991 to 1996 on the automatic generation of optimizing and parallel n-to-n cross-compilers. From 1996 to 1998, he worked as Research Engineer in the Associated Compiler Expert start-up factory at Amsterdam, The Netherlands. Then he worked 2 years at LORIA on the synchronisation of cooperative process fragment, based on workflow model, and applied to ephemeral enterprise. Since 2001, he is an Associate Professor at the Computer Science Laboratory (LIFC, EA 4269) at the University of Franche-Comté in France. His research topics deal with, on the one hand mobility services and wireless positioning, and on the other hand on robust and flexible optimizing algorithms based on graph, automata and rewriting theories.
Publication List:
(1) Geometric and Signal Strength Dilution of Precision (DoP) Wi-Fi, Volume 3, August 2009
About Philippe Canalda:
Dr Philippe Canalda got M.Sc. and Ph.D. Degrees in computer science from the University of OrlŽans (France) in 1991 and 1997, respectively. He worked at INRIA Rocquencourt from 1991 to 1996 on the automatic generation of optimizing and parallel n-to-n cross-compilers. From 1996 to 1998, he worked as Research Engineer in the Associated Compiler Expert start-up factory at Amsterdam, The Netherlands. Then he worked 2 years at LORIA on the synchronisation of cooperative process fragment, based on workflow model, and applied to ephemeral enterprise. Since 2001, he is an Associate Professor at the Computer Science Laboratory (LIFC, EA 4269) at the University of Franche-Comté in France. His research topics deal with, on the one hand mobility services and wireless positioning, and on the other hand on robust and flexible optimizing algorithms based on graph, automata and rewriting theories.
