223 search results - page 41 / 45 » Proving Termination by Bounded Increase |
106
click to vote
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
NIPS
2001
14 years 10 months ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
184
click to vote
DAGM
2011
Springer
13 years 9 months ago
2011
Springer
The supervised learning paradigm assumes in general that both training and test data are sampled from the same distribution. When this assumption is violated, we are in the setting...
JACM
2006
14 years 9 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...