Sciweavers

1696 search results - page 324 / 340
» Permuted function matching
Sort
View
ISCA
2002
IEEE
91views Hardware» more  ISCA 2002»
15 years 2 months ago
Slack: Maximizing Performance Under Technological Constraints
Many emerging processor microarchitectures seek to manage technological constraints (e.g., wire delay, power, and circuit complexity) by resorting to nonuniform designs that provi...
Brian A. Fields, Rastislav Bodík, Mark D. H...
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
15 years 2 months ago
Zero-Knowledge Proofs with Witness Elimination
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
Aggelos Kiayias, Hong-Sheng Zhou
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 2 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
15 years 2 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
DEXAW
1998
IEEE
92views Database» more  DEXAW 1998»
15 years 2 months ago
Self-Configuring Components for Client-/Server-Applications
A mechanistic view of software component assembly implies exact matching and fitting of the particular components. We argue that components for large-scale software construction s...
Wolfgang Pree, Egbert Althammer, Hermann Sikora