Sciweavers

9631 search results - page 297 / 1927
» The Costs of Using JXTA
Sort
View
DSN
2007
IEEE
16 years 1 months ago
Inherent Time Redundancy (ITR): Using Program Repetition for Low-Overhead Fault Tolerance
A new approach is proposed that exploits repetition inherent in programs to provide low-overhead transient fault protection in a processor. Programs repeatedly execute the same in...
Vimal K. Reddy, Eric Rotenberg
171
Voted
HICSS
2007
IEEE
131views Biometrics» more  HICSS 2007»
16 years 1 months ago
The Use of Attack and Protection Trees to Analyze Security for an Online Banking System
Online banking has become increasingly important to the profitability of financial institutions as well as adding convenience for their customers. As the number of customers using...
Kenneth S. Edge, Richard A. Raines, Michael R. Gri...
VTC
2007
IEEE
16 years 1 months ago
Fast and Area-Efficient Sphere Decoding Using Look-Ahead Search
— Sphere decoding enables maximum likelihood (ML) detection with fairly low complexity in the MIMO wireless systems, but it takes hundreds cycles at low SNR environment. This pap...
Se-Hyeon Kang, In-Cheol Park
FC
2007
Springer
128views Cryptology» more  FC 2007»
16 years 1 months ago
Informant: Detecting Sybils Using Incentives
We propose an economic approach to Sybil attack detection. In our Informant protocol, a detective offers a reward for Sybils to reveal themselves. The detective accepts from one i...
N. Boris Margolin, Brian Neil Levine
187
Voted
WAW
2007
Springer
77views Algorithms» more  WAW 2007»
16 years 28 days ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy