13603 search results - page 196 / 2721 » On the Complexity of Computing Treelength |
120
click to vote
ISSAC
2004
Springer
15 years 10 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
152
click to vote
SI3D
2003
ACM
15 years 9 months ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
172
click to vote
COMAD
2009
15 years 5 months ago
2009
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
153
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
136
click to vote
CAD
2000
Springer
15 years 4 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...