202 search results - page 18 / 41 » Locally identifying coloring of graphs |
145
click to vote
JMLR
2010
14 years 6 months ago
2010
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
115
click to vote
ATAL
2010
Springer
15 years 26 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
101
click to vote
ICCCN
2008
IEEE
15 years 6 months ago
2008
IEEE
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...
111
click to vote
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...