Result 41 to 60 of 166 total
Web services, service-oriented computing, and service-oriented architecture: separating hype from reality (English)
J. Database Manag. 19, No. 3, 42-54 (2008).
41
Finding one tight cycle (English)
SODA, 527-531 (2008).
42
Empty-ellipse graphs (English)
SODA, 1249-1257 (2008).
43
Testing contractibility in planar rips complexes (English)
Symposium on Computational Geometry, 251-259 (2008).
44
Walking your dog in the Woods in polynomial time (English)
Symposium on Computational Geometry, 101-109 (2008).
45
A requirements-based programming approach to developing a NASA autonomous ground control system. (English)
Artif. Intell. Rev. 25, No. 4, 285-297 (2006).
46
Finding small holes. A brief foray into computational topology. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 10th international workshop, WADS 2007, Halifax, Canada, August 15‒17, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73948-7/pbk). Lecture Notes in Computer Science 4619, 1 (2007).
47
Theoretical and practical complexity of modeling methods. (English)
Commun. ACM 50, No. 8, 46-51 (2007).
48
Capturing a convex object with three discs (English)
IEEE Transactions on Robotics 23, No. 6, 1133-1140 (2007).
49
Finding small holes (English)
WADS, 1 (2007).
50
Proceedings of the 23rd ACM symposium on computational geometry, gyeongju, south Korea, June 6-8, 2007 (English)
Symposium on Computational Geometry (2007).
51
Tightening non-simple paths and cycles on surfaces. (English)
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22‒24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 192-201 (2006).
52
Minimum-cost coverage of point sets by disks. (English)
Computational geometry (SCG’06). Proceedings of the twenty-second annual symposium on computational geometry 2006, Sedona, Arizona, USA, June, 05‒07, 2006. New York, NY: Association for Computing Machinery (ISBN 1-59593-340-9). 449-458 (2006).
53
Splitting (complicated) surfaces is hard. (English)
Computational geometry (SCG’06). Proceedings of the twenty-second annual symposium on computational geometry 2006, Sedona, Arizona, USA, June, 05‒07, 2006. New York, NY: Association for Computing Machinery (ISBN 1-59593-340-9). 421-429 (2006).
54
Minimum-cost coverage of point sets by disks. (English)
Comput. Res. Repos. 2006, Article No. 0604008 (2006).
55
Necklaces, convolutions, and $X + Y$. (English)
Azar, Yossi (ed.) et al., Algorithms ‒ ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11‒13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 160-171 (2006).
56
On the least median square problem. (English)
Discrete Comput. Geom. 36, No. 4, 593-607 (2006).
57
On the least median square problem (English)
Discrete & Computational Geometry 36, No. 4, 593-607 (2006).
58
Necklaces, convolutions, and $X + Y$ (English)
ESA, 160-171 (2006).
59
Tightening non-simple paths and cycles on surfaces (English)
SODA, 192-201 (2006).
60
Result 41 to 60 of 166 total