2487 search results - page 341 / 498 » Partitions of Graphs into Trees |
DCC
2000
IEEE
14 years 23 days ago
2000
IEEE
Wavelet zerotree encoding has been proven to be an efficient way of compressing still images. Two well-known zerotree encoding algorithms, Embedded Zerotree Encoding (EZW) and Se...
CPM
1999
Springer
14 years 19 days ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
SWAT
1992
Springer
14 years 12 days ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
FCCM
2009
IEEE
14 years 7 days ago
2009
IEEE
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. Due to the available on-chip memory and the number of I/O pins of Field Programmab...
HIS
2008
13 years 9 months ago
2008
The class imbalance problem (when one of the classes has much less samples than the others) is of great importance in machine learning, because it corresponds to many critical app...