7006 search results - page 262 / 1402 » Approximation Algorithms |
148
Voted
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
170
Voted
PG
2007
IEEE
15 years 10 months ago
2007
IEEE
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
113
Voted
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...
94
Voted
JMLR
2011
14 years 10 months ago
2011
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
115
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We provide a novel view of learning an approximate model of a partially observable environment from data and present a simple implemenf the idea. The learned model abstracts away ...