4903 search results - page 241 / 981 » The Set Covering Machine |
139
click to vote
MP
1998
15 years 6 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
203
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
The performance of an offline-trained classifier can be improved on-site by adapting the classifier towards newly acquired data. However, the adaptation rate is a tuning parame...
160
Voted
WWW
2005
ACM
16 years 7 months ago
2005
ACM
With the page explosion of WWW, how to cover more useful information with limited storage and computation resources becomes more and more important in web IR research. Using web p...
161
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
167
click to vote
SDM
2008
SIAM
15 years 7 months ago
2008
SIAM
Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...