829 search results - page 137 / 166 » Distance domination-critical graphs |
109
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior. This problem is encountered ubiquitously in cell biology ...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
AIPS
2004
15 years 1 months ago
2004
Scaling conformant planning is a problem that has received much attention of late. Many planners solve the problem as a search in the space of belief states, and some heuristic gu...
ACL
2003
15 years 1 months ago
2003
This paper presents a dependency language model (DLM) that captures linguistic constraints via a dependency structure, i.e., a set of probabilistic dependencies that express the r...
DM
2006
14 years 12 months ago
2006
The eccentric digraph ED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being `eccentric'; that is, there is an arc from u to v in ED(G)...