1469 search results - page 75 / 294 » Approximate polynomial decomposition |
101
click to vote
COLOGNETWENTE
2010
14 years 8 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
MICS
2010
14 years 8 months ago
2010
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
ICDT
2005
ACM
15 years 3 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...