1162 search results - page 158 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
ECCV
1998
Springer
14 years 9 days ago
1998
Springer
Different applications in the field of vision-based navigation of autonomous mobile robots depend on the degree of knowledge of the environment. Indoor environment applications oft...
DCC
2003
IEEE
14 years 1 months ago
2003
IEEE
- Rate-distortion theory is applied to the problem of joint compression and classification. A Lagrangian distortion measure is used to consider both the squared Euclidean error in ...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
In knowledge discovery applications, where new features are to be added, an acquisition policy can help select the features to be acquired based on their relevance and the cost of...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
MLMTA
2007
13 years 9 months ago
2007
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...