829 search results - page 41 / 166 » Distance domination-critical graphs |
108
click to vote
DASFAA
2010
IEEE
15 years 5 months ago
2010
IEEE
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
CVPR
2000
IEEE
16 years 1 months ago
2000
IEEE
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
103
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
AUSDM
2007
Springer
15 years 6 months ago
2007
Springer
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...
111
click to vote
ACSC
2005
IEEE
15 years 5 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...