831 search results - page 12 / 167 » Finding Minimum Data Requirements Using Pseudo-independence |
DCC
1996
IEEE
13 years 12 months ago
1996
IEEE
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
NETWORKS
2002
13 years 7 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
ICCCN
2008
IEEE
14 years 2 months ago
2008
IEEE
—The problem of designing high capacity and high bit rate IP-over-WDM networks, which can provide uninterrupted service in the presence of network equipment failures, continues t...
PICS
2000
13 years 9 months ago
2000
Digital photography has the potential to supersede conventional film photography. In order to realize this potential, digital photography needs to provide the best image quality a...