Results 1-7 of 7 (Search time: 0.001 seconds).
Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link | |
---|---|---|---|---|---|---|---|
1 | 2011 | Finding Maximum Sum Segments in Sequences with Uncertainty | Hung-I Yu; Tien-Ching Lin; D. T. Lee | ||||
2 | 2011 | An Output-Sensitive Approach for the L_1/L_infinity k Nearest Neighbor Voronoi Diagram | Liu, Chih-Hung; Papadopoulou, Evanthia; Lee, D. T. | ||||
3 | 2011 | The Density Maximization Problem in Graphs | Kao, Mong-Jen; Katz, Bastian; Krug, Marcus; Lee, D. T. ; Rutter, Ignaz; Wagner, Dorothea | ||||
4 | 2011 | Multiple-Instance Learning: Multiple Feature Selection on Instance Representation | Jhuo, I-Hong; Lee, D. T. | ||||
5 | 2011 | Connecting Two Trees with Optimal Routing Cost | Kao, Mong-Jen; Katz, Bastian; Krug, Marcus; Lee, D. T. ; Noellenburg, Martin; Rutter, Ignaz | ||||
6 | 2011 | Capacitated domination problem | Kao, M. J.; Liao, C. S.; Lee, D. T. | Algorithmica 60, 274-300 | |||
7 | 2011 | Constructing Optimal Shortcuts in Directed Weighted Paths | Klein, R.; Krug, M.; Langetepe, E.; Lee, D. T. ; Wagner, D. |