Sciweavers

FSTTCS
2006
Springer
15 years 7 months ago
Testing Probabilistic Equivalence Through Reinforcement Learning
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
Josee Desharnais, François Laviolette, Sami...
FSTTCS
2006
Springer
15 years 7 months ago
One-Input-Face MPCVP Is Hard for L, But in LogDCFL
A monotone planar circuit (MPC) is a Boolean circuit that can be embedded in a plane, and that has only AND and OR gates. Yang showed that the one-input-face monotone planar circui...
Tanmoy Chakraborty, Samir Datta
FSTTCS
2006
Springer
15 years 7 months ago
Unbiased Rounding of Rational Matrices
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph co...
Benjamin Doerr, Christian Klein
FSTTCS
2006
Springer
15 years 7 months ago
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
Gruia Calinescu, Michael J. Pelsmajer
FSTTCS
2006
Springer
15 years 7 months ago
Normal and Feature Approximations from Noisy Point Clouds
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...
Tamal K. Dey, Jian Sun