Kathleen Romanik

18 papers A* 3A 1B 1Journal 10Unranked 3
YearRankTypeTitle / Venue / Authors
2007 J jnl
A practical approximation algorithm for the LMS line estimator.
Comput. Stat. Data Anal.
David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu
2001 J jnl
Optimal Robot Localization in Trees.
Inf. Comput.
Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen
1998 J jnl
A Visibility Representation for Graphs in Three Dimensions.
J. Graph Algorithms Appl.
Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle
1998 J jnl
Localizing a Robot with Minimum Travel.
SIAM J. Comput.
Gregory Dudek, Kathleen Romanik, Sue Whitesides
1997 A* conf
A Practical Approximation Algorithm for the LMS Line Estimator.
SODA
David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu
1997 J jnl
Approximate Testing and Its Relationship to Learning.
Theor. Comput. Sci.
Kathleen Romanik
1997 J jnl
Directed Rectangle-visibility Graphs Have Unbounded Dimension.
Discret. Appl. Math.
Kathleen Romanik
1997 J jnl
Testing Simple Polygons.
Comput. Geom.
Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
1996 — conf
Optimal Robot Localization in Trees.
SCG
Kathleen Romanik, Sven Schuierer
1996 J jnl
Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments.
Inf. Comput.
Kathleen Romanik, Jeffrey Scott Vitter
1995 — conf
Directed rectangle visibility graphs have unbounded dimension.
CCCG
Kathleen Romanik
1995 A* conf
Localizing a Robot with Minimum Travel.
SODA
Gregory Dudek, Kathleen Romanik, Sue Whitesides
1995 J jnl
Testing Orthogonal Shapes.
Comput. Geom.
Kathleen Romanik, Steven Salzberg
1994 A conf
Directed VR-Representable Graphs have Unbounded Dimension.
GD
Kathleen Romanik
1994 J jnl
Testing Geometric Objects.
Comput. Geom.
Kathleen Romanik, Carl Smith
1993 — conf
Testing Simple Polygons.
CCCG
Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
1993 B conf
Using computational learning theory to analyze the testing complexity of program segments.
COMPSAC
Kathleen Romanik, Jeffrey Scott Vitter
1992 A* conf
Approximate Testing and Learnability.
COLT
Kathleen Romanik