1092 search results - page 97 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
181
click to vote
LICS
2005
IEEE
15 years 12 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
139
click to vote
APPML
2007
15 years 6 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
175
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
161
click to vote
DCC
2002
IEEE
16 years 5 months ago
2002
IEEE
This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(qm ). Unlike the original algorithm, the method introd...
146
click to vote
FSTTCS
2007
Springer
16 years 14 days ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...