1813 search results - page 209 / 363 » Calculi of Approximation Spaces |
188
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
218
click to vote
SIAMMA
2011
14 years 10 months ago
2011
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
177
click to vote
CVPR
2004
IEEE
16 years 9 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
186
click to vote
ECCV
2006
Springer
16 years 9 months ago
2006
Springer
This paper addresses the reconstruction of canal surfaces from single images. A canal surface is obtained as the envelope of a family of spheres of constant radius, whose center is...
165
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...