Sciweavers

17541 search results - page 3282 / 3509
» Complexity in scalable computing
Sort
View
NOCS
2007
IEEE
15 years 10 months ago
Transaction-Based Communication-Centric Debug
Abstract— The behaviour of systems on chip (SOC) is complex because they contain multiple processors that interact through concurrent interconnects, such as networks on chip (NOC...
Kees Goossens, Bart Vermeulen, Remco van Steeden, ...
RTSS
2007
IEEE
15 years 10 months ago
Energy-Aware Scheduling of Real-Time Tasks in Wireless Networked Embedded Systems
Recent technological advances have opened up several distributed real-time applications involving battery-driven embedded devices with local processing and wireless communication ...
G. Sudha Anil Kumar, G. Manimaran
ASIACRYPT
2007
Springer
15 years 10 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
CCS
2007
ACM
15 years 10 months ago
Privacy preserving error resilient dna searching through oblivious automata
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and...
Juan Ramón Troncoso-Pastoriza, Stefan Katze...
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
15 years 10 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson
« Prev « First page 3282 / 3509 Last » Next »