3757 search results - page 159 / 752 » The overlap number of a graph |
165
click to vote
ESCAPE
2007
Springer
15 years 10 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
164
click to vote
JCDL
2004
ACM
15 years 12 months ago
2004
ACM
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
142
click to vote
NIPS
2000
15 years 7 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
161
click to vote
MICCAI
2010
Springer
15 years 4 months ago
2010
Springer
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
191
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...