478 search results - page 72 / 96 » Approximation algorithms for general packing problems and th... |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
KDD
2009
ACM
14 years 3 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
JGO
2010
13 years 3 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...