Sciweavers

4137 search results - page 71 / 828
» On the number of matchings of a tree
Sort
View
COCOON
2006
Springer
15 years 5 months ago
On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...
Sheung-Hung Poon
IJFCS
2007
54views more  IJFCS 2007»
15 years 1 months ago
Pure and O-Substitution
The basic properties of distributivity and deletion of pure and o-substitution are investigated. The obtained results are applied to show preservation of recognizability in a numb...
Andreas Maletti
GIS
2009
ACM
15 years 8 months ago
Tree detection from aerial imagery
We propose an automatic approach to tree detection from aerial imagery. First a pixel-level classifier is trained to assign a {tree, non-tree} label to each pixel in an aerial im...
Lin Yang, Xiaqing Wu, Emil Praun, Xiaoxu Ma
ICWS
2009
IEEE
15 years 11 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
LICS
2007
IEEE
15 years 8 months ago
Higher-Order Matching, Games and Automata
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
Colin Stirling