32 search results - page 6 / 7 » Dual graph homomorphism functions |
112
click to vote
FSTTCS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
94
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We provide a novel formulation for computing median filter with spatial regularization as minimizing a cost function composed of absolute value norms. We turn this cost minimizat...
115
Voted
DCG
2010
15 years 15 days ago
2010
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
108
click to vote
TIP
1998
15 years 1 days ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
108
Voted
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
– Reducing power consumption through high-level synthesis has attracted a growing interest from researchers due to its large potential for power reduction. In this work we study ...