1067 search results - page 17 / 214 » Probabilistic regular graphs |
CCCG
2007
15 years 1 months ago
2007
We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid graph has a vertex set that is a subset of the grid ...
67
Voted
APPML
2004
15 years 8 days ago
2004
We study preservation of distance regularity when taking strong sums and strong products of distance-regular graphs. MSC 2000 Classification: 05C12
113
click to vote
ICIAR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulatio...
78
Voted
ACL
2004
15 years 1 months ago
2004
We compare two approaches for describing and generating bodies of rules used for natural language parsing. In today's parsers rule bodies do not exist a priori but are genera...
103
Voted
TCS
2008
15 years 9 days ago
2008
Let R be a resolution refutation, given as a sequence of clauses without explicit description of the underlying dag. Then, it is NPcomplete to decide whether R is a regular resolu...