1729 search results - page 158 / 346 » Bound Graph Polysemy |
208
click to vote
TIT
2010
15 years 1 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
187
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
In this paper, we propose an approach to accurately localize detected objects. The goal is to predict which features pertain to the object and define the object extent with segme...
164
click to vote
COMPGEOM
2009
ACM
16 years 28 days ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
149
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF...
187
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...