Sciweavers

4137 search results - page 39 / 828
» On the number of matchings of a tree
Sort
View
ACCV
1998
Springer
13 years 12 months ago
Learning Multiscale Image Models of 2D Object Classes
This paper isconcerned with learning the canonical gray scalestructure of the images of a classof objects. Structure is defined in terms of the geometry and layout of salientimage...
Benoit Perrin, Narendra Ahuja, Narayan Srinivasa
GECCO
2005
Springer
169views Optimization» more  GECCO 2005»
14 years 1 months ago
Inexact pattern matching using genetic algorithm
A Genetic Algorithm for graphical pattern matching based on angle matching had been proposed. It has proven quite effective in matching simple patterns. However, the algorithm nee...
Surapong Auwatanamongkol
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 1 months ago
On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
Jérôme Monnot
COMBINATORICS
2006
118views more  COMBINATORICS 2006»
13 years 7 months ago
Noncrossing Trees and Noncrossing Graphs
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
William Y. C. Chen, Sherry H. F. Yan
IIS
2003
13 years 9 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski