5210 search results - page 369 / 1042 » Exact geometric computation |
129
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
New algorithms for identification of a balanced state space representation are proposed. They are based on a procedure for the estimation of impulse response and sequential zero i...
182
Voted
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
173
click to vote
GC
2002
Springer
15 years 6 months ago
2002
Springer
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x = y of vertices such that both xy and yx a...
193
click to vote
TCS
2010
15 years 5 months ago
2010
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees...
222
click to vote
TGC
2010
Springer
15 years 4 months ago
2010
Springer
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...