4110 search results - page 278 / 822 » Efficient algorithms for the 2-gathering problem |
161
click to vote
IEAAIE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Configuration is the process of composing a system from a set of components such that the system fulfills a set of desired demands. The configuration process relies on a ...
158
click to vote
UAI
2004
15 years 8 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
179
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
175
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
147
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...