36 search results - page 6 / 8 » Labeling trees with a condition at distance two |
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
FGR
2011
IEEE
12 years 10 months ago
2011
IEEE
— Non-rigid object detection is a challenging open research problem in computer vision. It is a critical part in many applications such as image search, surveillance, humancomput...
ICML
2004
IEEE
14 years 7 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
ALMOB
2008
13 years 7 months ago
2008
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
WG
2005
Springer
14 years 10 days ago
2005
Springer
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most edge insertions or deletions such that it becomes a 4-leaf powe...