Sciweavers

195 search results - page 15 / 39
» Hiding the complexity of LBS
Sort
View
ANCS
2007
ACM
13 years 11 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
MICCAI
2004
Springer
14 years 8 months ago
A Data Clustering and Streamline Reduction Method for 3D MR Flow Vector Field Simplification
Abstract. With the increasing capability of MR imaging and Computational Fluid Dynamics (CFD) techniques, a significant amount of data related to the haemodynamics of the cardiovas...
Bernardo Silva Carmo, Yin-Heung Pauline Ng, Adam P...
SOSP
2007
ACM
14 years 4 months ago
Sinfonia: a new paradigm for building scalable distributed systems
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols—a major complication in existing distri...
Marcos Kawazoe Aguilera, Arif Merchant, Mehul A. S...
LCTRTS
2009
Springer
14 years 2 months ago
Debugging FPGA-based packet processing systems through transaction-level communication-centric monitoring
The fine-grained parallelism inherent in FPGAs has encouraged their use in packet processing systems. Debugging and performance evaluation of such complex designs can be signifi...
Paul Edward McKechnie, Michaela Blott, Wim Vanderb...
ICC
2008
IEEE
134views Communications» more  ICC 2008»
14 years 2 months ago
Secret Little Functions and Codebook for Protecting Users from Password Theft
—In this paper, we discuss how to prevent users’ passwords from being stolen by adversaries. We propose differentiated security mechanisms in which a user has the freedom to ch...
Yang Xiao, Chung-Chih Li, Ming Lei, Susan V. Vrbsk...