3267 search results - page 122 / 654 » Generalized quasirandom graphs |
104
click to vote
CVPR
2011
IEEE
14 years 3 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
149
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
In many domains, such as bioinformatics, cheminformatics, health informatics and social networks, data can be represented naturally as labeled graphs. To address the increasing ne...
116
click to vote
WSDM
2012
ACM
13 years 6 months ago
2012
ACM
In this work we propose a novel approach to anomaly detection in streaming communication data. We first build a stochastic model for the system based on temporal communication pa...
COLT
2004
Springer
15 years 4 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...