829 search results - page 105 / 166 » Distance domination-critical graphs |
CORR
2010
Springer
14 years 12 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...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at m...
129
click to vote
FPGA
2008
ACM
15 years 1 months ago
2008
ACM
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general p...
ICASSP
2010
IEEE
15 years 2 days ago
2010
IEEE
We develop an approach to intrinsic dimension estimation based on k-nearest neighbor (kNN) distances. The dimension estimator is derived using a general theory on functionals of k...
3DOR
2009
15 years 1 months ago
2009
Most of the approaches which address the problem of 3D object retrieval, use global descriptors of the objects which fail to consistently compensate for the intra-class variabilit...