573 search results - page 17 / 115 » Parallel Algorithms for Dandelion-Like Codes |
CAP
2010
13 years 3 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
With the availability of large datasets in a variety of scientific and commercial domains, data mining has emerged as an important area within the last decade. Data mining techni...
WAN
1998
Springer
14 years 18 days ago
1998
Springer
We consider parallel algorithms for computing the Hermite normal form of matrices over Euclidean rings. We use standard types of reduction methods which are the basis of many algor...
ICDCS
2010
IEEE
14 years 9 days ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
CDES
2006
13 years 9 months ago
2006
- Many memory-sensitive embedded applications can tolerate small performance degradations if doing so can reduce the memory space requirements significantly. This paper explores th...