1605 search results - page 171 / 321 » On Partitional Labelings of Graphs |
PAKDD
2010
ACM
14 years 3 months ago
2010
ACM
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...
ENDM
2008
13 years 10 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
EMNLP
2010
13 years 8 months ago
2010
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
SSDBM
2007
IEEE
14 years 4 months ago
2007
IEEE
We present a novel application of graph database mining to identify tertiary motifs in RNA structures. In od, we abstract an RNA molecule as a labeled graph and use a frequent sub...
PRL
2007
13 years 9 months ago
2007
In this paper, we tackle the problem of matching of objects in video in the context of the rough indexing paradigm. The approach developed is based on matching of region adjacency...