Jeff Abrahamson, Ph.D.
Affiliations: | 2007 | Drexel University, Philadelphia, PA, United States |
Area:
Computer ScienceGoogle:
"Jeff Abrahamson"Parents
Sign in to add mentor| Ali Shokoufandeh | grad student | 2007 | Drexel | |
| (Optimal matching and deterministic sampling.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Abrahamson J, Shokoufandeh A. (2010) Euclidean TSP on two polygons Theoretical Computer Science. 411: 1104-1114 |
| Abrahamson J, Csaba B, Shokoufandeh A. (2008) Optimal random matchings on trees and applications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5171: 254-265 |
| Abrahamson J, Shokoufandeh A. (2005) Lazy robots constrained by at most two polygons 2005 Ieee/Rsj International Conference On Intelligent Robots and Systems, Iros. 601-606 |
| Abrahamson J, Shokoufandeh A, Winter P. (2005) Euclidean TSP between two nested convex obstacles Information Processing Letters. 95: 370-375 |
| Denton T, Abrahamson J, Shokoufandeh A. (2004) Approximation of canonical sets and their applications to 2D view simplification Proceedings of the Ieee Computer Society Conference On Computer Vision and Pattern Recognition. 2: II550-II557 |
| Denton T, Demirci MF, Abrahamson J, et al. (2004) Selecting canonical views for view-based 3-D object recognition Proceedings - International Conference On Pattern Recognition. 2: 273-276 |