Sciweavers

11716 search results - page 2213 / 2344
» Computable symbolic dynamics
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 1 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
DAC
1998
ACM
14 years 1 months ago
Buffer Insertion for Noise and Delay Optimization
Interconnect-driven optimization is an increasingly important step in high-performance design. Algorithms for buffer insertion have been successfully utilized to reduce delay in gl...
Charles J. Alpert, Anirudh Devgan, Stephen T. Quay
CCS
2007
ACM
14 years 1 months ago
Analyzing network traffic to detect self-decrypting exploit code
Remotely-launched software exploits are a common way for attackers to intrude into vulnerable computer systems. As detection techniques improve, remote exploitation techniques are...
Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Pu...
CF
2007
ACM
14 years 1 months ago
An analysis of the effects of miss clustering on the cost of a cache miss
In this paper we describe a new technique, called pipeline spectroscopy, and use it to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogra...
Thomas R. Puzak, Allan Hartstein, Philip G. Emma, ...
CHI
2007
ACM
14 years 1 months ago
Follow the reader: filtering comments on slashdot
Large-scale online communities need to manage the tension between critical mass and information overload. Slashdot is a news and discussion site that has used comment rating to al...
Cliff Lampe, Erik W. Johnston, Paul Resnick
« Prev « First page 2213 / 2344 Last » Next »