1963 search results - page 189 / 393 » The Maximum Solution Problem on Graphs |
127
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
120
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
111
click to vote
WEA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
124
click to vote
WADS
1995
Springer
15 years 6 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
136
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Linear inverse problems in computer vision, including motion estimation, shape fitting and image reconstruction, give rise to parameter estimation problems with highly correlated ...