725 search results - page 5 / 145 » A General Greedy Approximation Algorithm with Applications |
125
click to vote
PODS
2007
ACM
15 years 11 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
101
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
WWW
2005
ACM
16 years 9 days ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
109
click to vote
ISAAC
2000
Springer
15 years 3 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...