Works matching IS 01290541 AND DT 2011 AND VI 22 AND IP 8
Results: 16
A DUAL COORDINATE DESCENT ALGORITHM FOR SVMs COMBINED WITH RATIONAL KERNELS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1761, doi. 10.1142/S0129054111009021
- By:
- Publication type:
- Article
PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1759, doi. 10.1142/S012905411100901X
- By:
- Publication type:
- Article
A FILTER-BASED ALGORITHM FOR EFFICIENT COMPOSITION OF FINITE-STATE TRANSDUCERS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1781, doi. 10.1142/S0129054111009033
- By:
- Publication type:
- Article
TREE-BASED 2D INDEXING.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1893
- By:
- Publication type:
- Article
STATE COMPLEXITY OF TWO COMBINED OPERATIONS:: CATENATION-UNION AND CATENATION-INTERSECTION.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1797, doi. 10.1142/S0129054111009045
- By:
- Publication type:
- Article
RELATIONAL STRING VERIFICATION USING MULTI-TRACK AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1909, doi. 10.1142/S0129054111009112
- By:
- Publication type:
- Article
WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1829, doi. 10.1142/S0129054111009069
- By:
- Publication type:
- Article
PARTIALLY ORDERED TWO-WAY BÜCHI AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1861, doi. 10.1142/S0129054111009082
- By:
- Publication type:
- Article
OPTIMAL HYPER-MINIMIZATION.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1877, doi. 10.1142/S0129054111009094
- By:
- Publication type:
- Article
IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1813, doi. 10.1142/S0129054111009057
- By:
- Publication type:
- Article
ON THE CIRCUIT-SIZE OF INVERSES.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1925, doi. 10.1142/S0129054111009124
- By:
- Publication type:
- Article
THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1845
- By:
- Publication type:
- Article
RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1939, doi. 10.1142/S0129054111009136
- By:
- Publication type:
- Article
APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1949, doi. 10.1142/S0129054111009148
- By:
- Publication type:
- Article
THE GRAPH-BIN PACKING PROBLEM.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1971, doi. 10.1142/S012905411100915X
- By:
- Publication type:
- Article
AUTHOR INDEX VOLUME 22 (2011).
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 8, p. 1995, doi. 10.1142/S0129054111009161
- Publication type:
- Article