Eugène Pechersky

According to our database, Eugène Pechersky authored at least 9 papers between 1997 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2016

Random walks in a queueing network environment.

M. Gannon, Eugène Pechersky, Yuri M. Suhov, Anatoly Yambartsev

J. Appl. Probab., 2016

2014

Discrete stochastic model for the generation of axonal trees.

Alejandro Mottini, Xavier Descombes, Florence Besse, Eugène Pechersky

Proceedings of the 36th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2014

2011

Gibbs models with a variable range of interactions on triangle grid.

Antonio Galves, Eugène Pechersky, Anatoly Yambartsev

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2008

Circle of interacting servers: Spontaneous collective behavior in the case of large fluctuations.

Nikita D. Vvedenskaya, E. A. Pechersky

Probl. Inf. Transm., 2008

2006

Wulff Shapes at Zero Temperature for Some Models Used in Image Processing.

Xavier Descombes, Eugène Pechersky

Proceedings of the Statistics and Analysis of Shapes, 2006

2004

Large deviation in a two-servers system with dynamic routing.

E. A. Pechersky, Yuri M. Suhov, Nikita D. Vvedenskaya

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

1999

Metropolis vs Kawasaki Dynamic for Image Segmentation Based on Gibbs Models.

Xavier Descombes, Eugène Pechersky

Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 1999

1998

Detection of linear features in SAR images: application to road network extraction.

Florence Tupin, Henri Maître, Jean-François Mangin, Jean-Marie Nicolas, Eugène Pechersky

IEEE Trans. Geosci. Remote. Sens., 1998

1997

A Graph-Based Representation to Detect Linear Features.

Florence Tupin, Jean-François Mangin, Eugène Pechersky, Jean-Marie Nicolas, Henri Maître

Proceedings of the Graph Based Representations in Pattern Recognition, 1997