4095 search results - page 158 / 819 » How to test a tree |
TCSV
2002
13 years 10 months ago
2002
Compressed video bitstreams require protection from channel errors in a wireless channel. The threedimensional (3-D) SPIHT coder has proved its efficiency and its real-time capabi...
PAMI
2012
12 years 1 months ago
2012
—There has been a growing interest in exploiting contextual information in addition to local features to detect and localize multiple object categories in an image. A context mod...
AINA
2007
IEEE
14 years 5 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
CSL
2007
Springer
14 years 4 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
ISAAC
2005
Springer
14 years 4 months ago
2005
Springer
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...