1664 search results - page 108 / 333 » Distance labeling in graphs |
138
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
140
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
127
click to vote
TCS
2008
15 years 4 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
129
click to vote
ICDCS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
133
click to vote
SEMWEB
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...