736 search results - page 47 / 148 » Distinguishing geometric graphs |
104
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
In Graph Minors III, Robertson and Seymour write:"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal -- indeed, w...
114
click to vote
VISUAL
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. In this paper, we present novel image-derived, invariant features that accurately capture both the geometric and color properties of an imaged object. These features can ...
CMSB
2006
Springer
15 years 3 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
EOR
2008
14 years 12 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
128
click to vote
TSMC
2010
14 years 6 months ago
2010
Feature-based image watermarking schemes, which aim to survive various geometric distortions, have attracted great attention in recent years. Existing schemes have shown robustness...