1389 search results - page 77 / 278 » Improved Approximation Algorithms for Label Cover Problems |
ACL
2009
15 years 25 days ago
2009
With the aim to deal with sentiment-transfer problem, we proposed a novel approach, which integrates the sentiment orientations of documents into the graph-ranking algorithm. We a...
125
click to vote
CD
2005
Springer
15 years 8 months ago
2005
Springer
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
128
click to vote
AAAI
2010
15 years 4 months ago
2010
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
136
click to vote
STACS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
150
click to vote
WIRN
2005
Springer
15 years 8 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...