1664 search results - page 70 / 333 » Distance labeling in graphs |
ESA
1999
Springer
15 years 4 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
120
click to vote
ACCV
2009
Springer
15 years 6 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
100
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
DCC
2007
IEEE
15 years 11 months ago
2007
IEEE
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
ICTAI
2006
IEEE
15 years 6 months ago
2006
IEEE
Computer programs that can be expressed in two or more dimensions are typically called visual programs. The underlying theories of visual programming languages involve graph gramm...