200 search results - page 36 / 40 » Approximation Algorithms for Scheduling on Multiple Machines |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
VLDB
2001
ACM
14 years 2 days ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g....