116 results on '"Fabien Feschet"'
Search Results
2. Cluster Detection Tests in Spatial Epidemiology: A Global Indicator for Performance Assessment.
3. New Characterizations of Full Convexity.
4. An Envelope Operator for Full Convexity to Define Polyhedral Models in Digital Spaces.
5. Full Convexity for Polyhedral Models in Digital Spaces.
6. Segment- and Arc-Based Vectorizations by Multi-scale/Irregular Tangential Covering.
7. Robust reconstructions by multi-scale/irregular tangential covering.
8. Implementation of a Denoising Algorithm Based on High-Order Singular Value Decomposition of Tensors.
9. Reconstructions of Noisy Digital Contours with Maximal Primitives Based on Multi-scale/Irregular Geometric Representation and Generalized Linear Programming.
10. Super-resolution in Clinical Conditions: Deep Brain Stimulation Case Study.
11. Knot Detection from Accumulation Map by Polar Scan.
12. Tool for the Evaluation of Innovative Therapies - Multi-agent based System.
13. Introduction to Digital Level Layers.
14. The Saturated Subpaths Decomposition in Z 2 : a short note on generalized Tangential Cover.
15. Linear Decomposition of Planar Shapes.
16. Multiscale Analysis of Digital Segments by Intersection of 2D Digital Lines.
17. Multiscale Analysis from 1D Parametric Geometric Decomposition of Shapes.
18. Multi-primitive Analysis of Digital Curves.
19. Efficient Lattice Width Computation in Arbitrary Dimension.
20. Multiscale Discrete Geometry.
21. Robust Decomposition of Thick Digital Shapes.
22. The lattice width and quasi-straightness in digital spaces.
23. Gift-Wrapping Based Preimage Computation Algorithm.
24. Tangential Cover for Thick Digital Curves.
25. Parallelization of a Discrete Radiosity Method Using Scene Division.
26. The Exact Lattice Width of Planar Sets and Minimal Arithmetical Thickness.
27. Parallelization of a Discrete Radiosity Method.
28. A Generic Approach for n-Dimensional Digital Lines.
29. Maximal Digital Straight Segments and Convergence of Discrete Geometric Estimators.
30. Fast Guaranteed Polygonal Approximations of Closed Digital Curves.
31. Optimal Blurred Segments Decomposition in Linear Time.
32. Computerized Tomography with Digital Lines and Linear Programming.
33. Segment- and Arc-Based Vectorizations by Multi-scale/Irregular Tangential Covering
34. Efficient Local Search in Conceptual Clustering.
35. Comparison of Three Objective Functions for Conceptual Clustering.
36. A New Methodology to Compare Clustering Algorithms.
37. An Experimental Study of Partition Quality Indices in Clustering.
38. Computing efficiently the lattice width in any dimension.
39. Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature.
40. Tangential cover for thick digital curves.
41. Gift-wrapping based preimage computation algorithm.
42. Optimal Multiple Intervals Discretization of Continuous Attributes for Supervised Learning.
43. Convex Digital Polygons, Maximal Digital Straight Segments and Convergence of Discrete Geometric Estimators.
44. Optimal blurred segments decomposition of noisy shapes in linear time.
45. On the min DSS problem of closed discrete curves.
46. On digital plane preimage structure.
47. Application of a discrete tomography algorithm to computerized tomography.
48. Canonical representations of discrete curves.
49. An approach for the estimation of the precision of a real object from its digitization.
50. Digital plane preimage structure.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.