Sciweavers

4137 search results - page 164 / 828
» On the number of matchings of a tree
Sort
View
CORR
2012
Springer
176views Education» more  CORR 2012»
14 years 2 months ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
AUSAI
2007
Springer
15 years 10 months ago
Building Classification Models from Microarray Data with Tree-Based Classification Algorithms
Building classification models plays an important role in DNA mircroarray data analyses. An essential feature of DNA microarray data sets is that the number of input variables (gen...
Peter J. Tan, David L. Dowe, Trevor I. Dix
ECCV
1998
Springer
16 years 8 months ago
Concerning Bayesian Motion Segmentation, Model, Averaging, Matching and the Trifocal Tensor
Abstract. Motion segmentation involves identifying regions of the image that correspond to independently moving objects. The number of independently moving objects, and type of mot...
Philip H. S. Torr, Andrew Zisserman
ACIVS
2008
Springer
16 years 27 days ago
Blur and Contrast Invariant Fast Stereo Matching
We propose a novel approach for estimating a depth-map from a pair of rectified stereo images degraded by blur and contrast change. At each location in image space, information is...
Matteo Pedone, Janne Heikkilä
DSD
2007
IEEE
140views Hardware» more  DSD 2007»
16 years 27 days ago
Pseudo-Random Pattern Generator Design for Column-Matching BIST
This paper discusses possibilities for a choice of a pseudorandom pattern generator that is to be used in combination with the column-matching based built-in self-test design meth...
Petr Fiser