1067 search results - page 6 / 214 » Probabilistic regular graphs |
92
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This nonlocal graph allows to adapt the penalization to t...
84
Voted
DM
2008
15 years 10 days ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian...
74
Voted
4OR
2011
14 years 6 months ago
2011
Abstract This paper provides a survey on probabilistic decision graphs for mod
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
121
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...