105 search results - page 3 / 21 » Representing Trees of Higher Degree |
91
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract— This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and r...
73
Voted
SYNTHESE
2010
14 years 10 months ago
2010
The focus of the paper is on the logic of clarity and the problem of higherorder vagueness. We first examine the consequences of the notion of intransitivity of indiscriminabilit...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper investigates the operations of the wavelet tree based quantization and proposes a constrained wavelet tree quantization for image watermarking. The wavelet coefficients ...
108
Voted
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
TCS
2002
14 years 11 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. ...