108
Voted
ISAAC
2000
Springer
15 years 7 months ago
2000
Springer
152
click to vote
ISAAC
2000
Springer
15 years 7 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...
145
Voted
SIGIR
1998
ACM
15 years 7 months ago
1998
ACM
Extraction of phrasal knowledge, such as proper names, domain-specific keyphrases and lexical templates from a domain-specific text collection are significant for developing effec...
155
click to vote
ISAAC
2000
Springer
15 years 7 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...