217 search results - page 30 / 44 » Parameterized algorithms for d-Hitting Set: The weighted cas... |
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
AAAI
2008
15 years 3 days ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
COLT
2001
Springer
15 years 2 months ago
2001
Springer
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...
KDD
1999
ACM
15 years 2 months ago
1999
ACM
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
107
click to vote
GECON
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...