Sciweavers

1664 search results - page 218 / 333
» Distance labeling in graphs
Sort
View
LICS
2010
IEEE
15 years 4 months ago
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
Martin Otto
CORR
2011
Springer
152views Education» more  CORR 2011»
15 years 1 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
ICML
2003
IEEE
16 years 7 months ago
Learning Metrics via Discriminant Kernels and Multidimensional Scaling: Toward Expected Euclidean Representation
Distance-based methods in machine learning and pattern recognition have to rely on a metric distance between points in the input space. Instead of specifying a metric a priori, we...
Zhihua Zhang
ICML
2000
IEEE
16 years 7 months ago
Solving the Multiple-Instance Problem: A Lazy Learning Approach
As opposed to traditional supervised learning, multiple-instance learning concerns the problem of classifying a bag of instances, given bags that are labeled by a teacher as being...
Jun Wang, Jean-Daniel Zucker
ICPR
2008
IEEE
16 years 27 days ago
A self-organized approach for unsupervised fault detection in multiple systems
An approach is proposed for automatic fault detection in a population of mechatronic systems. The idea is to employ self-organizing algorithms that produce lowdimensional represen...
Thorsteinn S. Rögnvaldsson, Georg Panholzer, ...