99 search results - page 10 / 20 » Improved bounds and new techniques for Davenport-Schinzel se... |
IPPS
2000
IEEE
14 years 25 days ago
2000
IEEE
In this paper, we propose a method which enables us to construct almost optimal broadcast schemes on an n-dimensional hypercube in the circuit switched, -port model. In this mode...
JMLR
2006
13 years 8 months ago
2006
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
COLT
2000
Springer
14 years 23 days 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...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...