NSTL国家科技图书文献中心

1. Proper colorability of segment intersection graphs NSTL国家科技图书文献中心

Barish, Robert D. | Shibuya, Tetsuo - 《Journal of combinatorial optimization》 - 2024,47(4) - ARTN 70～ - 共48页

摘要： intersection graphs* of line segments embedded in the plane* | , corresponding to intersection graphs* of unit length segments* | -DIR graphs* under the Exponential Time Hypothesis* | We consider the vertex proper coloring problem | for highly restricted instances of geometric

关键词： Proper coloring | Proper vertex coloring | Geometric intersection graph | Segment intersection graph | Unit segment intersection graph | SEG graphs | k-DIR graphs | PURE-k-DIR Graphs | NP | #P...

2. Graph-based image gradients aggregated with random forests EI 工程索引 NSTL国家科技图书文献中心

Almeida, Raquel | Kijak, Ewa ... - 《Pattern recognition letters》 - 2023,166(Feb.) - 182～189 - 共8页 - 被引量：2

摘要：-weighted graphs* aggregated with Random Forest (RF) to* | details impacted the final seg-mentation. Statistical | Gradient methods subject images to a series of | operations to enhance some characteristics and facilitate | image analysis, usually the contours of large objects

关键词： Random forest | Graph | Segmentation | Edge detection | Hierarchical watershed

3. Proper Colorability of Segment Intersection Graphs NSTL国家科技图书文献中心

Robert D. Barish | Tetsuo Shibuya - 《Computing and combinatorics: 28th international computing and combinatorics conference (COCOON 2022), 22-24 October 2022, Shenzhen, China》 - International computing and combinatorics conference - 2022, - 573～584 - 共12页

摘要： intersection graphs* of line segments embedded in the plane* | -DIR corresponding to intersection graphs* of segments* | We consider the vertex proper coloring problem | for highly restricted instances of geometric | . We show that, provided a graph in the class PURE-k

关键词： Proper coloring | Proper vertex coloring | Geometric intersection graph | Segment intersection graph | Unit segment intersection graph | NP-hard | SEG graphs | k-DIR graphs | PURE-k-DIR graphs

4. LTP: Lane-based Trajectory Prediction for Autonomous Driving NSTL国家科技图书文献中心

Jingke Wang | Tengju Ye ... - 《2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition: CVPR 2022, New Orleans, Louisiana, USA, 18-24 June 2022, [v.1]》 - IEEE/CVF Conference on Computer Vision and Pattern Recognition - 2022, - 17113～17121 - 共9页

摘要： method that exploits the sliced lane seg-ments as fine | -graphs* and the agents sub-graphs. In addition, we* | The reasonable trajectory prediction of | surrounding traf-fic participants is crucial for autonomous | driving. Espe-cially, how to predict multiple plausible

关键词： Tracking | Shape | Navigation | Prediction methods | Transformers | Trajectory | Pattern recognition

5. Learning Whole-Slide Segmentation from Inexact and Incomplete Labels Using Tissue Graphs NSTL国家科技图书文献中心

Valentin Anklin | Pushpak Pati ... - 《Medical Image Computing and Computer Assisted Intervention - MICCAI 2021: 24th International Conference, Strasbourg, France, September 27 - October 1, 2021, Proceedings, Part II》 - International Conference on Medical Image Computing and Computer Assisted Intervention - 2021, - 636～646 - 共11页

摘要： segmentation method using graphs, that can utilize weak | : https://github.com/histocartography/seg-gini. | Segmenting histology images into | diagnostically relevant regions is imperative to support timely | and reliable decisions by pathologists. To this end

关键词： Weakly-supervised semantic segmentation | Scalable digital pathology | Multiplex annotations | Graphs in digital pathology

NSTL主题词： Segmentation | segmentation | Learning

6. Intersection graphs of L-shapes and segments in the plane NSTL国家科技图书文献中心

Felsner, Stefan | Knauer, Kolja ... - 《Discrete Applied Mathematics》 - 2016,206 - 48～55 - 共8页 - 被引量：8

摘要： known subclasses of SEG-graphs* and show that they are* | -graph or SEG-graph, respectively. Motivated by a | perpenticular}-graph is a SEG-graph, we investigate several | {left perpenticular}-graphs, or B-k-VPG-graphs* for* | -trees, all line graphs* of planar graphs, and all full*

关键词： Intersection graphs | Segment graphs | Co-planar graphs | k-bend VPG-graphs | Planar 3-trees

7. Intersection Graphs of L-Shapes and Segments in the Plane NSTL国家科技图书文献中心

Stefan Felsner | Kolja Knauer ... - 《Mathematical foundations of computer science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014, Proceedings, part II》 - International Symposium on Mathematical Foundations of Computer Science - 2014, - 299～310 - 共12页

摘要： investigate several known subclasses of SEG-graphs* and show* | {└ }-graph, {└ ,「}-graph, B_k-VPG-graph or SEG-graph | ], stating that every {└ ,「}-graph is a SEG-graph, we | that they are {└ }-graphs, or B_k-VPG-graphs* for some* | line graphs* of planar graphs, and all full*

关键词： Intersection graphs | Segment graphs | Co-planar graphs | K-bend VPG-graphs | Planar 3-trees

NSTL主题词： Planing | Intersection | Crossing | Platanus hybrida | plane | Segments

8. Intersection Graphs of L-Shapes and Segments in the Plane NSTL国家科技图书文献中心

Stefan Felsner | Kolja Knauer ... - 《Mathematical foundations of computer science 2014, Part 2: 39th international symposium on mathematical foundations of computer science (MFCS 2014), August 25-29, 2014, Budapest, Hungary》 - International symposium on mathematical foundations of computer science - 2014, - 299～310 - 共12页

摘要： investigate several known subclasses of SEG-graphs* and show* | }-graph, {L, Γ}-graph, B_k-VPG-graph or SEG-graph | ], stating that every {L, Γ}-graph is a SEG-graph, we | that they are {L}-graphs, or B_k-VPG-graphs* for some* | line graphs* of planar graphs, and all full*

关键词： Intersection graphs | segment graphs | co-planar graphs | k-bend VPG-graphs | planar 3-trees

NSTL主题词： Planing | Segments

9. Parameterized Construction of Program Representations for Sparse Dataflow Analyses NSTL国家科技图书文献中心

André Tavares | Benoit Boissinot ... - 《Compiler construction》 - European Conferences on Theory and Practice of Software - 2014, - 18～39 - 共22页

摘要： et al.'s Sparse Evaluation Graphs* (SEG) for the* | Data-flow analyses usually associate | information with control flow regions. Informally, if these | regions are too small, like a point between two | consecutive statements, we call the analysis dense. On the

关键词： Dataflow | SEG | Parameterized Construction

NSTL主题词： data flow | representations | parameterization

10. Scalable network traffic visualization using compressed graphs NSTL国家科技图书文献中心

Shi, Lei | Liac, Qi ... - 《2013 IEEE International Conference on Big Data: 2013 IEEE International Conference on Big Data, 6-9 October 2013, Santa Clara, CA, USA》 - IEEE International Conference on Big Data - 2013, - 606～612 - 共7页

摘要： Equivalence Grouping (SEG). Based on the intrinsic nature of | the computer network traffic, SEG* condenses the* | critical connectivity information. Computationally, SEG | , directed and weighted traffic graphs* up to a million* | Visualization (NSAV) tool based on SEG* and conducted case*

摘要： intersection graphs* of line segments embedded in the plane* | , corresponding to intersection graphs* of unit length segments* | -DIR graphs* under the Exponential Time Hypothesis* | We consider the vertex proper coloring problem | for highly restricted instances of geometric

关键词： Proper coloring | Proper vertex coloring | Geometric intersection graph | Segment intersection graph | Unit segment intersection graph | SEG graphs | k-DIR graphs | PURE-k-DIR Graphs | NP | #P...

摘要：-weighted graphs* aggregated with Random Forest (RF) to* | details impacted the final seg-mentation. Statistical | Gradient methods subject images to a series of | operations to enhance some characteristics and facilitate | image analysis, usually the contours of large objects

关键词： Random forest | Graph | Segmentation | Edge detection | Hierarchical watershed

摘要： intersection graphs* of line segments embedded in the plane* | -DIR corresponding to intersection graphs* of segments* | We consider the vertex proper coloring problem | for highly restricted instances of geometric | . We show that, provided a graph in the class PURE-k

关键词： Proper coloring | Proper vertex coloring | Geometric intersection graph | Segment intersection graph | Unit segment intersection graph | NP-hard | SEG graphs | k-DIR graphs | PURE-k-DIR graphs

摘要： method that exploits the sliced lane seg-ments as fine | -graphs* and the agents sub-graphs. In addition, we* | The reasonable trajectory prediction of | surrounding traf-fic participants is crucial for autonomous | driving. Espe-cially, how to predict multiple plausible

关键词： Tracking | Shape | Navigation | Prediction methods | Transformers | Trajectory | Pattern recognition

摘要： segmentation method using graphs, that can utilize weak | : https://github.com/histocartography/seg-gini. | Segmenting histology images into | diagnostically relevant regions is imperative to support timely | and reliable decisions by pathologists. To this end

关键词： Weakly-supervised semantic segmentation | Scalable digital pathology | Multiplex annotations | Graphs in digital pathology

NSTL主题词： Segmentation | segmentation | Learning

摘要： known subclasses of SEG-graphs* and show that they are* | -graph or SEG-graph, respectively. Motivated by a | perpenticular}-graph is a SEG-graph, we investigate several | {left perpenticular}-graphs, or B-k-VPG-graphs* for* | -trees, all line graphs* of planar graphs, and all full*

关键词： Intersection graphs | Segment graphs | Co-planar graphs | k-bend VPG-graphs | Planar 3-trees

摘要： investigate several known subclasses of SEG-graphs* and show* | {└ }-graph, {└ ,「}-graph, B_k-VPG-graph or SEG-graph | ], stating that every {└ ,「}-graph is a SEG-graph, we | that they are {└ }-graphs, or B_k-VPG-graphs* for some* | line graphs* of planar graphs, and all full*

关键词： Intersection graphs | Segment graphs | Co-planar graphs | K-bend VPG-graphs | Planar 3-trees

NSTL主题词： Planing | Intersection | Crossing | Platanus hybrida | plane | Segments

摘要： investigate several known subclasses of SEG-graphs* and show* | }-graph, {L, Γ}-graph, B_k-VPG-graph or SEG-graph | ], stating that every {L, Γ}-graph is a SEG-graph, we | that they are {L}-graphs, or B_k-VPG-graphs* for some* | line graphs* of planar graphs, and all full*

关键词： Intersection graphs | segment graphs | co-planar graphs | k-bend VPG-graphs | planar 3-trees

NSTL主题词： Planing | Segments

摘要： et al.'s Sparse Evaluation Graphs* (SEG) for the* | Data-flow analyses usually associate | information with control flow regions. Informally, if these | regions are too small, like a point between two | consecutive statements, we call the analysis dense. On the

关键词： Dataflow | SEG | Parameterized Construction

NSTL主题词： data flow | representations | parameterization

关键词： Graph Compression | Security | Visualization

NSTL主题词： traffic network | telecommunication traffic | Scalability | Visualization | COMPRESSED

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： intersection graphs of line segments embedded in the plane | , corresponding to intersection graphs of unit length segments | -DIR graphs under the Exponential Time Hypothesis | We consider the vertex proper coloring problem | for highly restricted instances of geometric

关键词： Proper coloring | Proper vertex coloring | Geometric intersection graph | Segment intersection graph | Unit segment intersection graph | SEG graphs | k-DIR graphs | PURE-k-DIR Graphs | NP | #P...

摘要：-weighted graphs aggregated with Random Forest (RF) to | details impacted the final seg-mentation. Statistical | Gradient methods subject images to a series of | operations to enhance some characteristics and facilitate | image analysis, usually the contours of large objects

关键词： Random forest | Graph | Segmentation | Edge detection | Hierarchical watershed

摘要： intersection graphs of line segments embedded in the plane | -DIR corresponding to intersection graphs of segments | We consider the vertex proper coloring problem | for highly restricted instances of geometric | . We show that, provided a graph in the class PURE-k

关键词： Proper coloring | Proper vertex coloring | Geometric intersection graph | Segment intersection graph | Unit segment intersection graph | NP-hard | SEG graphs | k-DIR graphs | PURE-k-DIR graphs

摘要： method that exploits the sliced lane seg-ments as fine | -graphs and the agents sub-graphs. In addition, we | The reasonable trajectory prediction of | surrounding traf-fic participants is crucial for autonomous | driving. Espe-cially, how to predict multiple plausible

关键词： Tracking | Shape | Navigation | Prediction methods | Transformers | Trajectory | Pattern recognition

摘要： segmentation method using graphs, that can utilize weak | : https://github.com/histocartography/seg-gini. | Segmenting histology images into | diagnostically relevant regions is imperative to support timely | and reliable decisions by pathologists. To this end

关键词： Weakly-supervised semantic segmentation | Scalable digital pathology | Multiplex annotations | Graphs in digital pathology

NSTL主题词： Segmentation | segmentation | Learning

摘要： known subclasses of SEG-graphs and show that they are | -graph or SEG-graph, respectively. Motivated by a | perpenticular}-graph is a SEG-graph, we investigate several | {left perpenticular}-graphs, or B-k-VPG-graphs for | -trees, all line graphs of planar graphs, and all full

关键词： Intersection graphs | Segment graphs | Co-planar graphs | k-bend VPG-graphs | Planar 3-trees

摘要： investigate several known subclasses of SEG-graphs and show | {└ }-graph, {└ ,「}-graph, B_k-VPG-graph or SEG-graph | ], stating that every {└ ,「}-graph is a SEG-graph, we | that they are {└ }-graphs, or B_k-VPG-graphs for some | line graphs of planar graphs, and all full

关键词： Intersection graphs | Segment graphs | Co-planar graphs | K-bend VPG-graphs | Planar 3-trees

NSTL主题词： Planing | Intersection | Crossing | Platanus hybrida | plane | Segments

摘要： investigate several known subclasses of SEG-graphs and show | }-graph, {L, Γ}-graph, B_k-VPG-graph or SEG-graph | ], stating that every {L, Γ}-graph is a SEG-graph, we | that they are {L}-graphs, or B_k-VPG-graphs for some | line graphs of planar graphs, and all full

关键词： Intersection graphs | segment graphs | co-planar graphs | k-bend VPG-graphs | planar 3-trees

NSTL主题词： Planing | Segments

摘要： et al.'s Sparse Evaluation Graphs (SEG) for the | Data-flow analyses usually associate | information with control flow regions. Informally, if these | regions are too small, like a point between two | consecutive statements, we call the analysis dense. On the

关键词： Dataflow | SEG | Parameterized Construction

NSTL主题词： data flow | representations | parameterization

摘要： Equivalence Grouping (SEG). Based on the intrinsic nature of | the computer network traffic, SEG condenses the | critical connectivity information. Computationally, SEG | , directed and weighted traffic graphs up to a million | Visualization (NSAV) tool based on SEG and conducted case

关键词： Graph Compression | Security | Visualization

NSTL主题词： traffic network | telecommunication traffic | Scalability | Visualization | COMPRESSED

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： intersection graphs* of line segments embedded in the plane* | , corresponding to intersection graphs* of unit length segments* | -DIR graphs* under the Exponential Time Hypothesis* | We consider the vertex proper coloring problem | for highly restricted instances of geometric

摘要：-weighted graphs* aggregated with Random Forest (RF) to* | details impacted the final seg-mentation. Statistical | Gradient methods subject images to a series of | operations to enhance some characteristics and facilitate | image analysis, usually the contours of large objects

摘要： intersection graphs* of line segments embedded in the plane* | -DIR corresponding to intersection graphs* of segments* | We consider the vertex proper coloring problem | for highly restricted instances of geometric | . We show that, provided a graph in the class PURE-k

摘要： method that exploits the sliced lane seg-ments as fine | -graphs* and the agents sub-graphs. In addition, we* | The reasonable trajectory prediction of | surrounding traf-fic participants is crucial for autonomous | driving. Espe-cially, how to predict multiple plausible

摘要： known subclasses of SEG-graphs* and show that they are* | -graph or SEG-graph, respectively. Motivated by a | perpenticular}-graph is a SEG-graph, we investigate several | {left perpenticular}-graphs, or B-k-VPG-graphs* for* | -trees, all line graphs* of planar graphs, and all full*

摘要： investigate several known subclasses of SEG-graphs* and show* | {└ }-graph, {└ ,「}-graph, B_k-VPG-graph or SEG-graph | ], stating that every {└ ,「}-graph is a SEG-graph, we | that they are {└ }-graphs, or B_k-VPG-graphs* for some* | line graphs* of planar graphs, and all full*

摘要： investigate several known subclasses of SEG-graphs* and show* | }-graph, {L, Γ}-graph, B_k-VPG-graph or SEG-graph | ], stating that every {L, Γ}-graph is a SEG-graph, we | that they are {L}-graphs, or B_k-VPG-graphs* for some* | line graphs* of planar graphs, and all full*

摘要： et al.'s Sparse Evaluation Graphs* (SEG) for the* | Data-flow analyses usually associate | information with control flow regions. Informally, if these | regions are too small, like a point between two | consecutive statements, we call the analysis dense. On the