5030 search results - page 211 / 1006 » cases 2007 |
174
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
We consider the wavelet transform of a finite, rooted, node-ranked, p-way tree, focusing on the case of binary (p = 2) trees. We study a Haar wavelet transform on this tree. Wave...
163
click to vote
ENTCS
2007
15 years 7 months ago
2007
We study one of the many aspects of privacy, which is referred to as data anonymity, in a formal context. Data anonymity expresses whether some piece of observed data, such as a v...
180
click to vote
EOR
2007
15 years 7 months ago
2007
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routin...
172
click to vote
GC
2007
Springer
15 years 7 months ago
2007
Springer
We determine lower and upper bounds for the size of a hyperplane of the dual polar space DW(5, q). In some cases, we also determine all hyperplanes attaining these bounds.
162
click to vote
IPL
2007
15 years 7 months ago
2007
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...