Searching for "Call control on lines." – sorted by Relevance.
-
Competitive Non-Preemptive Call Control
- randomization, this extends the work of Garay et al. on call control for the line network [GGKMY] to tree
- Cited by 103 (10 self) – Add To MetaCart
-
Document Marking and Identification using Both Line and Word Shifting
- to carry one bit of the identifier unique to the document. The neighboring lines, called the control lines
- Cited by 17 (3 self) – Add To MetaCart
-
Performance Comparison of Two Text Marking Methods
- are all sufficiently long. The neighboring lines, called the control lines, are not marked. Alternatively
- Cited by 9 (1 self) – Add To MetaCart
-
Combining Online Algorithms for Rejection and Acceptance
- is admission control and call control on the line. In particular, there exist constant competitive algorithms
- Cited by 4 (2 self) – Add To MetaCart
-
Document Identification for Copyright Protection using Centroid Detection
- neighboring lines are all sufficiently long. The neighboring lines, called the control lines, are not marked
- Cited by 14 (4 self) – Add To MetaCart
-
Combining online algorithms for acceptance and rejection
- , which motivated this work, is admission control and call control on the line graph. Requests
- Cited by 1 (1 self) – Add To MetaCart
-
Admissible Transformation Volume for Part Dimensional Quality Gauging
- are explicitly identified. Huang used a method called control line rotation scheme to identify points
- Cited by 1 (0 self) – Add To MetaCart

