1039 search results - page 112 / 208 » Kernels and Regularization on Graphs |
105
Voted
STOC
2005
ACM
16 years 1 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
105
click to vote
CSR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
140
Voted
HEURISTICS
2006
15 years 24 days ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...
85
Voted
IPL
2000
15 years 18 days ago
2000
Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the ro...
191
Voted
ICIP
1994
IEEE
15 years 4 months ago
1994
IEEE
The two main plagues of image restoration are oscillations and smoothing. Traditional image restoration techniques prevent parasitic oscillations by resorting to smooth regulariza...