255 search results - page 11 / 51 » Spanning Trees and Function Classes |
SACRYPT
1999
Springer
14 years 20 days ago
1999
Springer
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m . We call these sequences elliptic curve...
GD
2006
Springer
14 years 2 days ago
2006
Springer
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
PLDI
2009
ACM
14 years 9 months ago
2009
ACM
Class sharing is a new language mechanism for building extensible software systems. Recent work has separately explored two different kinds of extensibility: first, family inherit...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
AIMSA
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. Decision trees are considered as an efficient technique to express classification knowledge and to use it. However, their most standard algorithms do not deal with uncert...