10988 search results - page 2019 / 2198 » Algorithmic Folding Complexity |
115
click to vote
ISCA
2009
IEEE
15 years 10 months ago
2009
IEEE
In the past decade, the proliferation of mobile devices has increased at a spectacular rate. There are now more than 3.3 billion active cell phones in the world—a device that we...
135
click to vote
WISA
2009
Springer
15 years 10 months ago
2009
Springer
Power analysis has shown to be successful in breaking symmetric cryptographic algorithms implemented on low resource devices. Prompted by the breaking of many protected implementat...
132
click to vote
EMSOFT
2009
Springer
15 years 10 months ago
2009
Springer
Concurrent programming languages are growing in importance with the advent of multi-core systems. However, concurrent programs suffer from problems, such as data races and deadloc...
137
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
161
click to vote
KSEM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...