12194 search results - page 220 / 2439 » Numberings Optimal for Learning |
188
click to vote
IJCAI
2003
15 years 7 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
152
click to vote
DAM
1998
15 years 6 months ago
1998
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
150
click to vote
ICCD
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper describes a novel approach to nd a tighter bound of the transformation of the Min-Max problems into the one of Least-Square Estimation. It is well known that the above ...
166
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
179
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
In recent years, the blogosphere has experienced a substantial increase in the number of posts published daily, forcing users to cope with information overload. The task of guidin...