1389 search results - page 141 / 278 » Improved Approximation Algorithms for Label Cover Problems |
144
click to vote
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
179
click to vote
ALT
2009
Springer
16 years 7 days ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
163
click to vote
ILP
2004
Springer
15 years 8 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
131
Voted
VMV
2003
15 years 4 months ago
2003
The visual hull is an efficient shape approximation for the purpose of reconstructing and visualizing dynamic objects. Recently, rapid progress in graphics hardware development h...
253
click to vote
ICDE
2003
IEEE
16 years 4 months ago
2003
IEEE
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...