829 search results - page 17 / 166 » Distance domination-critical graphs |
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
115
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We present a fast technique for retrieving video clips using free-hand sketched queries. Visual keypoints within each video are detected and tracked to form short trajectories, wh...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
129
click to vote
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...