Sciweavers

2479 search results - page 363 / 496
» A Computational Theory of Working Memory
Sort
View
IACR
2011
152views more  IACR 2011»
14 years 5 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
ICDCS
2012
IEEE
13 years 8 months ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang
ICS
2009
Tsinghua U.
16 years 1 months ago
Less reused filter: improving l2 cache performance via filtering less reused lines
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
Lingxiang Xiang, Tianzhou Chen, Qingsong Shi, Wei ...
CONCURRENCY
1998
87views more  CONCURRENCY 1998»
15 years 5 months ago
Titanium: A High-performance Java Dialect
Titanium is a language and system for high-performance parallel scientific computing. Titanium uses Java as its base, thereby leveraging the advantages of that language and allow...
Katherine A. Yelick, Luigi Semenzato, Geoff Pike, ...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 11 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen