Sciweavers

4137 search results - page 150 / 828
» On the number of matchings of a tree
Sort
View
TSP
2010
15 years 1 months ago
Learning Gaussian tree models: analysis of error exponents and extremal structures
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
GECCO
2004
Springer
15 years 12 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby
CVPR
2009
IEEE
1517views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Linear Solution to Scale and Rotation Invariant Object Matching
Images of an object undergoing ego- or camera- motion often appear to be scaled, rotated, and deformed versions of each other. To detect and match such distorted patterns to a s...
Hao Jiang, Stella X. Yu
ICIAP
2007
ACM
16 years 6 months ago
Efficient and optimal block matching for motion estimation
This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation....
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
ADHOCNOW
2008
Springer
16 years 26 days ago
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
Andreas Wiese, Evangelos Kranakis