653 results on '"Asano, Tetsuo"'
Search Results
2. A New Transportation Problem on a Graph with Sending and Bringing-Back Operations
3. Chemical ablation of the left ventricular endocardium reduces ventricular fibrillation inducibility in acute ischemic canine heart
4. A New Transportation Problem on a Graph with Sending and Bringing-Back Operations
5. Memory-Constrained Algorithms for Simple Polygons
6. Constructing Optimal Highways
7. -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability
8. Depth-First Search Using Bits
9. Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands.
10. Transportation Problem Allowing Sending and Bringing Back
11. Combinatorial and Geometric Problems Related to Digital Halftoning
12. Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems
13. Priority Queues and Sorting for Read-Only Data
14. Small Work Space Algorithms for Some Basic Problems on Binary Images
15. A New Framework for Connected Components Labeling of Binary Images
16. Collision Probability in an In-Line Machines Model
17. In-Place Linear-Time Algorithms for Euclidean Distance Transform
18. Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
19. Do We Need a Stack to Erase a Component in a Binary Image?
20. Kaboozle Is NP-complete, Even in a Strip
21. Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
22. Reprint of: Memory-constrained algorithms for simple polygons
23. Finding Nearest Larger Neighbors : A Case Study in Algorithm Design and Analysis
24. Constant-Working-Space Algorithms for Image Processing
25. Linear Boundary and Corner Detection Using Limited Number of Sensor Rows
26. In-Place Algorithm for Image Rotation
27. Optimal Triangulation with Steiner Points
28. A Combined Radial Basis Function Model for Fingerprint Distortion
29. Polyline Fitting of Planar Points Under Min-sum Criteria
30. A Generalization of Magic Squares with Applications to Digital Halftoning
31. A Near-linear Time Algorithm for Binarization of Fingerprint Images Using Distance Transform
32. Transportation problem on a graph
33. On Geometric Structure of Global Roundings for Graphs and Range Spaces
34. Disc Covering Problem with Application to Digital Halftoning
35. Memory-constrained algorithms for simple polygons
36. The Structure and Number of Global Roundings of a Graph
37. How to Color a Checkerboard with a Given Distribution — Matrix Rounding Achieving Low 2 × 2-Discrepancy
38. Minimum-Length Polygons in Approximation Sausages
39. Algorithms for projecting points to give the most uniform distribution with applications to hashing
40. Dynamically Maintaining the Widest k-Dense Corridor
41. Effective Use of Geometric Properties for Clustering
42. On the Complexities of the Optimal Rounding Problems of Sequences and Matrices
43. A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree
44. Faster computation of the Robinson–Foulds distance between phylogenetic networks
45. Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image
46. Convertibility among Grid Filling Curves
47. Space filling curves and their use in the design of geometric data structures
48. Designing algorithms for commodities transportation on a planar graph modelling a map
49. A unified scheme for detecting fundamental curves in binary edge images
50. Reporting and counting intersections of lines within a polygon
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.