3731 search results - page 231 / 747 » cases 2006 |
158
click to vote
MST
2010
15 years 5 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
163
click to vote
MST
2010
15 years 5 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
194
click to vote
PAMI
2010
15 years 5 months ago
2010
In this paper, we present a new Adaptive Scale Kernel Consensus (ASKC) robust estimator as a generalization of the popular and state-of-the-art robust estimators such as RANSAC (R...
182
click to vote
PAMI
2010
15 years 5 months ago
2010
—The goal of this paper is to correct bleed-through in degraded documents using a variational approach. The variational model is adapted using an estimated background according t...
165
click to vote
RSA
2010
15 years 5 months ago
2010
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...