Sciweavers

2661 search results - page 468 / 533
» Quantum Complexity Classes
Sort
View
PLDI
2005
ACM
15 years 6 months ago
Jungloid mining: helping to navigate the API jungle
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
David Mandelin, Lin Xu, Rastislav Bodík, Do...
106
Voted
ICALP
2005
Springer
15 years 6 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
141
Voted
UPP
2004
Springer
15 years 6 months ago
From Prescriptive Programming of Solid-State Devices to Orchestrated Self-organisation of Informed Matter
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
Klaus-Peter Zauner
EUROPAR
2003
Springer
15 years 6 months ago
KOJAK - A Tool Set for Automatic Performance Analysis of Parallel Programs
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
Bernd Mohr, Felix Wolf
104
Voted
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
15 years 6 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler