1469 search results - page 75 / 294 » Approximate polynomial decomposition |
158
click to vote
COLOGNETWENTE
2010
15 years 3 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...
137
click to vote
CDC
2009
IEEE
15 years 8 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...
138
click to vote
COMPGEOM
2009
ACM
15 years 11 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...
128
click to vote
MICS
2010
15 years 2 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...
135
click to vote
ICDT
2005
ACM
15 years 10 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...