1469 search results - page 257 / 294 » Approximate polynomial decomposition |
101
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
SMI
2005
IEEE
15 years 5 months ago
2005
IEEE
The recent ability to measure quickly and inexpensively dense sets of points on physical objects has deeply influenced the way engineers used to represent shapes in CAD systems, ...
105
click to vote
SMI
2005
IEEE
15 years 5 months ago
2005
IEEE
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
108
click to vote
SMA
2005
ACM
15 years 5 months ago
2005
ACM
We propose a fast and robust method for detecting crest lines on surfaces approximated by dense triangle meshes. The crest lines, salient surface features defined via first- and...
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...