1149 search results - page 48 / 230 » Minimally non-Pfaffian graphs |
ICIAR
2007
Springer
15 years 6 months ago
2007
Springer
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered...
105
click to vote
SCALESPACE
2007
Springer
15 years 6 months ago
2007
Springer
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variation...
62
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
CPC
2002
14 years 11 months ago
2002
Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...
JAIR
2011
14 years 6 months ago
2011
Temporal information has been the focus of recent attention in information extraction, leading to some standardization effort, in particular for the task of relating events in a t...