122 results on '"PING GU"'
Search Results
2. Algorithms for the Ridesharing with Profit Constraint Problem.
3. Dual-Attention Based Joint Aspect Sentiment Classification Model.
4. Disease Correlation Enhanced Attention Network for ICD Coding.
5. Multimodal Transportation with Ridesharing of Personal Vehicles.
6. An Efficient Oracle for Counting Shortest Paths in Planar Graphs.
7. Approximate Ridesharing of Personal Vehicles Problem.
8. Outlier detection based on sparse coding and neighbor entropy in high-dimensional space.
9. Active Sample Selection Through Sparse Neighborhood for Imbalanced Datasets.
10. A Cloud-based Framework for Implementing Portable Machine Learning Pipelines for Neural Data Analysis.
11. Efficient Algorithms for Ridesharing of Personal Vehicles.
12. Algorithmic Analysis for Ridesharing of Personal Vehicles.
13. Transforming UML Class Diagram into Cassandra Data Model with Annotations.
14. A Queuing-Network-Based Approach to Performance Evaluation of Service Compositions.
15. Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs.
16. A Practical Algorithm for Embedding Graphs on Torus.
17. Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs.
18. Workflow Management Systems Meet Model Drive Architecture.
19. Carving-decomposition based algorithms for the maximum path coloring problem.
20. Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem.
21. Computational Study for Planar Connected Dominating Set Problem.
22. Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size.
23. Inspection of Surface Defects in Copper Strip Based on Machine Vision.
24. Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time.
25. Computational Study on Dominating Set Problem of Planar Graphs.
26. Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs.
27. Computing Branch Decomposition of Large Planar Graphs.
28. A Multi-view Approach to Semi-supervised Document Classification with Incremental Naïve Bayes.
29. Dynamic Local Focusing Approach for Production Scheduling Problems.
30. Maximizing Throughput for Traffic Grooming with Limited Grooming Resources.
31. Wavelength Assignment in Multifiber WDM Star and Spider Networks.
32. A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks.
33. A Chinese Mobile Phone Input Method Based on the Dynamic and Self-study Language Model.
34. A New Chaos-Based Encryption Method for Color Image.
35. A Dynamic and Self-study Language Model Oriented to Chinese Characters Input.
36. Efficient Algorithms for Traffic Grooming in SONET/WDM Networks.
37. Grooming of Symmetric Traffic in Unidirectional SONET/WDM Rings.
38. Concept Based Text Classification Using Labeled and Unlabeled Data.
39. Optimal Branch-Decomposition of Planar Graphs in O(n3) Time.
40. From UML to LQN by XML algebra-based model transformations.
41. Wavelength Assignment on Bounded Degree Trees of Rings.
42. Early evaluation of software performance based on the UML performance profile.
43. Efficient Algorithm for Embedding Hypergraphs in a Cycle.
44. On-line Permutation Routing on WDM All-Optical Networks.
45. XSLT transformation from UML models to LQN performance models.
46. Multicasts on WDM All-Optical Multistage Interconnection Networks.
47. Multi-hop All-to-All Broadcast on WDM Optical Networks.
48. Research on the ESCC assessment data processing method.
49. Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks.
50. Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.