53 search results - page 2 / 11 » BKM: A new hardware algorithm for complex elementary functio... |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Checking if microprocessor cores are fully functional at the end of the productive process has become a major issue. Traditional functional approaches are not sufficient when cons...
SIGPRO
2011
13 years 2 months ago
2011
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...