1068 search results - page 63 / 214 » Extremely randomized trees |
TCS
2002
13 years 8 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
IJBRA
2010
13 years 6 months ago
2010
The TreeSAAP software has been successfully used in a variety of protein studies for identifying and characterizing adaptation in terms of shifts in the physicochemical properties ...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
ICPPW
1999
IEEE
14 years 1 months ago
1999
IEEE
A new method for updating certificate revocation trees (CRT) is proposed. Efficient revocation of publickey certificates is a current issue in public-key Infrastructure because a ...
DAM
2007
13 years 8 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...