2899 search results - page 62 / 580 » Dynamic Trees in Practice |
FSTTCS
2001
Springer
14 years 1 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
ISCAS
1999
IEEE
14 years 1 months ago
1999
IEEE
- Closed form solutions for the 50% delay, rise time, overshoot characteristics, and settling time of signals in an RLC tree are presented. These solutions have the same accuracy c...
ETRICS
2006
14 years 16 days ago
2006
Privacy-preserving decision tree mining is an important problem that has yet to be thoroughly understood. In fact, the privacypreserving decision tree mining method explored in the...
JALC
2007
13 years 8 months ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
ACPC
1999
Springer
14 years 1 months ago
1999
Springer
Multi-resolution methods are widely used in scientific visualization, image processing, and computer graphics. While many applications only require an one-time construction of the...