Sciweavers

558 search results - page 27 / 112
» Trees and Matchings
Sort
View
FOSSACS
2009
Springer
15 years 6 months ago
Dependency Tree Automata
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
Colin Stirling
ICMCS
2005
IEEE
148views Multimedia» more  ICMCS 2005»
15 years 5 months ago
Compressed Domain Image Indexing and Retrieval Based on the Minimal Spanning Tree
In this paper, a method for content-based retrieval of JPEG images is presented, utilizing features directly from the discrete cosine transform (DCT) domain. Image indexing is ach...
Christos Theoharatos, Vassilios K. Pothos, George ...
ECML
2005
Springer
15 years 5 months ago
Model Selection in Omnivariate Decision Trees
We propose an omnivariate decision tree architecture which contains univariate, multivariate linear or nonlinear nodes, matching the complexity of the node to the complexity of the...
Olcay Taner Yildiz, Ethem Alpaydin
ICWS
2009
IEEE
15 years 9 months ago
Intelligent Matching for Public Internet Web Services Towards Semi-Automatic Internet Services Mashup
In this paper, we propose an Internet public Web service matching approach that paves the way for (semi-)automatic service mashup. We will first provide the overview of the soluti...
Chen Wu, Tharam S. Dillon, Elizabeth Chang
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
15 years 6 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar