361 search results - page 17 / 73 » Relaxed Gabriel Graphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
TKDE
2002
13 years 7 months ago
2002
Since WWW encourages hypertext and hypermedia document authoring (e.g. HTML or XML), Web authors tend to create documents that are composed of multiple pages connected with hyperl...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
ORL
2008
13 years 7 months ago
2008
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...