Sciweavers

10608 search results - page 1940 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 5 months ago
Spatio-temporal Multi-dimensional Relational Framework Trees
—The real world is composed of sets of objects that move and morph in both space and time. Useful concepts can be defined in terms of the complex interactions between the multi-...
Matthew Bodenhamer, Samuel Bleckley, Daniel Fennel...
ISCA
2009
IEEE
161views Hardware» more  ISCA 2009»
14 years 5 months ago
AnySP: anytime anywhere anyway signal processing
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...
Mark Woh, Sangwon Seo, Scott A. Mahlke, Trevor N. ...
WISA
2009
Springer
14 years 5 months ago
You Cannot Hide behind the Mask: Power Analysis on a Provably Secure S-Box Implementation
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...
J. Pan, J. I. den Hartog, Jiqiang Lu
EMSOFT
2009
Springer
14 years 5 months ago
Compositional deadlock detection for rendezvous communication
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...
Baolin Shao, Nalini Vasudevan, Stephen A. Edwards
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 5 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
« Prev « First page 1940 / 2122 Last » Next »