28888 search results - page 5654 / 5778 » Computability and complexity in analysis |
WWW
2005
ACM
14 years 10 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
WWW
2005
ACM
14 years 10 months ago
2005
ACM
Many modern natural language-processing applications utilize search engines to locate large numbers of Web documents or to compute statistics over the Web corpus. Yet Web search e...
WWW
2004
ACM
14 years 10 months ago
2004
ACM
The ability to accurately identify the network traffic associated with different P2P applications is important to a broad range of network operations including application-specifi...
ASPLOS
2009
ACM
14 years 10 months ago
2009
ACM
Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a s...
ASPLOS
2009
ACM
14 years 10 months ago
2009
ACM
Future processors are expected to observe increasing rates of hardware faults. Using Dual-Modular Redundancy (DMR), two cores of a multicore can be loosely coupled to redundantly ...