Sciweavers

359 search results - page 6 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
FSTTCS
2008
Springer
13 years 8 months ago
On the Power of Imperfect Information
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect informatio...
Dietmar Berwanger, Laurent Doyen
CGF
2006
125views more  CGF 2006»
13 years 7 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
SODA
2012
ACM
223views Algorithms» more  SODA 2012»
11 years 10 months ago
Data reduction for weighted and outlier-resistant clustering
Statistical data frequently includes outliers; these can distort the results of estimation procedures and optimization problems. For this reason, loss functions which deemphasize ...
Dan Feldman, Leonard J. Schulman
ICCV
2005
IEEE
14 years 9 months ago
Globally Optimal Estimates for Geometric Reconstruction Problems
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...
Fredrik Kahl, Didier Henrion
EXACT
2009
13 years 5 months ago
Explaining a Result to the End-User: A Geometric Approach for Classification Problems
This paper addresses the issue of the explanation of the result given to the end-user by a classifier, when it is used as a decision support system. We consider machine learning cl...
Isabelle Alvarez, Sophie Martin