2944 search results - page 365 / 589 » Improving Bound Propagation |
205
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
171
click to vote
CPM
1999
Springer
15 years 11 months ago
1999
Springer
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
193
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
216
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
146
click to vote
ICNP
1996
IEEE
15 years 10 months ago
1996
IEEE
Abstract-- We present a scheduling protocol, called TimeShift Scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a p...