Optimal Robot Localization in Trees\Lambda (2009)
Kathleen Romanik, Sven Schuiererz
Abstract The problem of localization, i.e. of a robot finding its position on a map, is an important task for autonomous mobile robots. It has applications in numerous areas of robotics ranging from...
1 Testing Complexity of Program Segments (2008)
Kathleen Romanik, Kathleen Romanik
Abstract: We examine the complexity of testing di erent program constructs. We do this by de ning a measure of testing complexity known as VCP-dimension, which is similar to the Vapnik-Chervonenkis...
Abstract Localizing a Robot with Minimum Travel (2008)
Gregory Dudek, Kathleen Romanik, Sue Whitesides
We consider the problem of localizing a robot in a known environment modeled by a simple polygon P. We assume that the robot has a map of P but is placed at an unknown location. The robot must move...
Localizing an Object With Finger Probes (2007)
Robert Freimer Samir, Samir Khuller, Christine Piatko, Kathleen Romanik, Diane Souvaine
We consider the problem of identifying one of a set of polygonal models in the plane using point probes and finger probes. In particular, we give strategies for using a minimum number of finger...
Directed Rectangle-Visibility Graphs have Unbounded Dimension (2007)
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. One visibility representation in the plane that has been...
Hazel Everett, Anna Lubiw, Henk Meijer, Kathleen Romanik, Tom Shermer, Sue Whitesides
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. Application areas such as VLSI wire routing and circuit...
Testing Complexity of Program Segments (2007)
Kathleen Romanik, Kathleen Romanik
Abstract: We examine the complexity of testing different program constructs. We do this by defining a measure of testing complexity known as VCP-dimension, which is similar to the Vapnik-Chervonenkis...
Rudolf Fleischer, Kathleen Romanik, Sven Schuierer
The problem of localization, that is, of a robot finding its position on a map, is an important task for autonomous mobile robots. It has applications in numerous areas of robotics ranging from...
Localizing a Robot with Minimum Travel 3 (2007)
Gregory Dudek, Kathleen Romanik, Sue Whitesides
We consider the problem of localizing a robot in a known environment modeled by a simple polygon P. We assume that the robot has a map of P but is placed at an unknown location inside P. From its...
User modeling for information filtering based on implicit feedback (2001)
This study reports the results of a pair of user studies that can provide a practical basis for designing an information filtering system that employs implicit feedback for user modeling. In...
Optimal robot localization in trees (2000)
Rudolf Fleischer, Kathleen Romanik, Sven Schuierer
The problem of localization, that is, of a robot finding its position on a map, is an important task for autonomous mobile robots. It has applications in numerous areas of robotics ranging from...
Using implicit feedback for user modeling in Internet and Intranet searching (2000)
Jinmook Kim, Douglas W. Oard, Kathleen Romanik
Powerize Server 1.0, developed by Powerize.com, is a content-based information filtering and retrieval system that presently uses a manually constructed user model known as a search profile. User...
User Modeling for Information Access Based on Implicit Feedback (2000)
Jinmook Kim, Douglas W. Oard, Kathleen Romanik
User modeling can be used in information filtering and retrieval systems to improve the representation of a user's information needs. User models can be constructed by hand, or learned...
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Anna Lubiw, Henk Meijer, Kathleen Romanik, Thomas C. Shermer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices are mapped to rectangles oating in R
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Anna Lubiw, Henk Meijer, Kathleen Romanik, Thomas C. Shermer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices are mapped to rectangles oating in R
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Anna Lubiw, Henk Meijer, Kathleen Romanik, Thomas C. Shermer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices are mapped to rectangles oating in R
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Anna Lubiw, Henk Meijer, Kathleen Romanik, Thomas C. Shermer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices are mapped to rectangles oating in R
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V,E) in which vertices are mapped to rectangles floating in R 3 parallel to the x, y-plane, with edges represented by...
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V,E) in which vertices are mapped to rectangles floating in R 3 parallel to the x, y-plane, with edges represented by...
Angewandte Mathematik und Informatik Universit at zu K oln (1997)
Report No On, Hazel Everett, Hazel Everett, S'andor P. Fekete, S'andor P. Fekete, Michael E. Houle, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices are mapped to rectangles floating in R 3 parallel to the x; y-plane, with edges represented by...
On a Visibility Representation of Graphs in 3D (1997)
Prosenjit Bose, Hazel Everett, Hazel Everett, Sandor P. Fekete, S'andor P. Fekete, Michael E. Houle, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices are mapped to rectangles floating in R 3 parallel to the x; y-plane, with edges represented by...
A Practical Approximation Algorithm for the LMS Line Estimator (1997)
David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are particularly important because of their...
Approximate Testing and Its Relationship to Learning (1997)
Testing plays an integral part in many areas of computer science. In relation to computational learning theory, testing can be viewed as an inverse process to learning. Testing algorithms create a...
Optimal Robot Localization in Trees (1996)
Kathleen Romanik, Sven Schuierer
The problem of localization, i.e. of a robot finding its position on a map, is an important task for autonomous mobile robots. It has applications in numerous areas of robotics ranging from aerial...
Directed VR-Representable Graphs Have Unbounded Dimension (1995)
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. A three-dimensional visibility representation that has been...
Directed VR-Representable Graphs Have Unbounded Dimension (1995)
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. A three-dimensional visibility representation that has been...
Directed VR-Representable Graphs Have Unbounded Dimension (1995)
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. A three-dimensional visibility representation that has been...
Angewandte Mathematik und Informatik Universit at zu K oln (1995)
Report No On, Qu'ebec Ga H, Hazel Everett, Hazel Everett, S'andor P. Fekete, S'andor P. Fekete, ...
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. Application areas such as VLSI wire routing and circuit...
Localizing a Robot with Minimum Travel (1995)
Gregory Dudek, Kathleen Romanik, Sue Whitesides
We consider the problem of localizing a robot in a known environment modeled by a simple polygon P . We assume that the robot has a map of P but is placed at an unknown location. The robot must move...
Directed Rectangle-Visibility Graphs have Unbounded Dimension (1995)
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. One visibility representation in the plane that has been...
Geometric Probing and Testing - A Survey (1995)
Geometric probing is the area of computational geometry that studies how to identify, verify, or determine some property of an unknown geometric object using a measuring device known as a probe. It...
Localizing a Robot with Minimum Travel (1995)
Gregory Dudek, Kathleen Romanik, Sue Whitesides
We consider the problem of localizing a robot in a known environment modeled by a simple polygon P . We assume that the robot has a map of P but is placed at an unknown location inside P . From its...
On a Visibility Representation for Graphs in Three Dimensions (1995)
Prosenjit Bose, Qu'ebec Ga H, Hazel Everett, Hazel Everett, Sandor P. Fekete, S'andor P. Fekete, ...
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. Application areas such as VLSI wire routing and circuit...
Localizing A Robot With Minimum Travel (1995)
Gregory Dudek Kathleen, Kathleen Romanik, Sue Whitesides
We consider the problem of localizing a robot in a known environment modeled by a simple polygon P . We assume that the robot has a map of P but is placed at an unknown location inside P . From its...
Localizing an object with finger probes (1994)
Freimer, Robert, Khuller, Samir, Mitchell, Joe, Piatko, Christine, Romanik, Kathleen, Souvaine, Diane
We consider the problem of identifying one of a set of polygonal models in the plane using point probes and finger probes. In particular, we give strategies for using a minimum number of finger...
Localizing an object with finger probes (1994)
Freimer, Robert, Khuller, Samir, Mitchell, Joe, Piatko, Christine, Romanik, Kathleen, Souvaine, Diane
We consider the problem of identifying one of a set of polygonal models in the plane using point probes and finger probes. In particular, we give strategies for using a minimum number of finger...
Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments (1994)
Kathleen Romanik, Kathleen Romanik, Jeffrey Scott Vitter, Jeffrey Scott Vitter
: We examine the complexity of testing different program constructs. We do this by defining a measure of testing complexity known as VCP-dimension, which is similar to the Vapnik-Chervonenkis...
Directed VR-Representable Graphs have Unbounded Dimension (1994)
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. A three-dimensional visibility representation that has been...
On a Visibility Representation for Graphs in Three Dimensions (1993)
Prosenjit Bose, Hazel Everett, Sandor P. Fekete, Anna Lubiw, Henk Meijer, Kathleen Romanik, ...
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. Application areas such as VLSI wire routing and circuit...
Approximate testing theory /--Kathleen Ann Rebecca Romanik. (1992)
"August 1992"--Cover.
A practical approximation algorithm for the LMS line estimator
Mount, David M., Netanyahu, Nathan S., Romanik, Kathleen, Silverman, Ruth, Wu, Angela Y.
Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments
Kathleen Romanik, Jeffrey Scott Vitter
: We examine the complexity of testing different program constructs. We do this by defining a measure of testing complexity known as VCP-dimension, which is similar to the Vapnik-Chervonenkis...