Sciweavers

9736 search results - page 37 / 1948
» How Fast Can We Compute Products
Sort
View
AINA
2007
IEEE
15 years 10 months ago
Event based Extensible Interactive Transparent Networking: Performance Study with Fast TCP Principles
Interactive Transparent Networking has been proposed to support a new generation of symbiotic applications that require advance interaction with the Network. In this mode advanced...
Javed I. Khan, Pradeep K. Punnam, Raid Zaghal
IPPS
1998
IEEE
15 years 8 months ago
Mechanically Verifying the Correctness of the Fast Fourier Transform in ACL2
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
Ruben Gamboa
IEEEARES
2007
IEEE
15 years 10 months ago
Compartmented Security for Browsers - Or How to Thwart a Phisher with Trusted Computing
Identity theft through phishing attacks has become a major concern for Internet users. Typically, phishing attacks aim at luring the user to a faked web site to disclose personal ...
Sebastian Gajek, Ahmad-Reza Sadeghi, Christian St&...
PC
2007
119views Management» more  PC 2007»
15 years 4 months ago
Brokering strategies in computational grids using stochastic prediction models
In this paper we propose a new routing policy to route jobs to clusters in computational grids. This routing policy is based on index tables computed at each cluster. These tables...
Vandy Berten, Bruno Gaujal
ISSAC
2007
Springer
106views Mathematics» more  ISSAC 2007»
15 years 10 months ago
Numerical techniques for computing the inertia of products of matrices of rational numbers
Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively smal...
John P. May, B. David Saunders, David Harlan Wood