6740 search results - page 399 / 1348 » An s -Hamiltonian Line Graph Problem |
207
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
229
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
178
click to vote
ICPP
2005
IEEE
16 years 10 days ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
206
click to vote
ICANN
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Radial basis function (RBF) kernels are widely used for support vector machines. But for model selection, we need to optimize the kernel parameter and the margin paramete...
150
click to vote
JCDCG
2004
Springer
16 years 3 days ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...