17329 search results - page 10 / 3466 » Improved non-approximability results |
DCG
2010
13 years 8 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
ICSE
2010
IEEE-ACM
14 years 1 months ago
2010
IEEE-ACM
Search is a fundamental activity in software development. However, to search source code efficiently, it is not sufficient to implement a traditional full text search over a base ...
ETS
2007
IEEE
14 years 2 months ago
2007
IEEE
— A novel statistical learning algorithm is proposed to accurately analyze volume diagnosis results. This algorithm effectively overcomes the inherent ambiguities in logic diagno...
STOC
1994
ACM
14 years 2 days ago
1994
ACM
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Web image search using text queries has received considerable attention. However, current state-of-the-art approaches require training models for every new query, and are therefore...