Sciweavers

24529 search results - page 336 / 4906
» Computing on Authenticated Data
Sort
View
129
Voted
IJHPCN
2006
109views more  IJHPCN 2006»
15 years 4 months ago
Communication issues within high performance computing grids
: This paper presents several ideas pertaining to desirable properties associated with protocols for moving large amounts of data over a grid of high performance computers. The pro...
Robert D. McLeod, Sajid Hussain, Sheng Huang, Mare...
WABI
2010
Springer
143views Bioinformatics» more  WABI 2010»
15 years 2 months ago
Swiftly Computing Center Strings
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
Franziska Hufsky, Léon Kuchenbecker, Kathar...
ICASSP
2011
IEEE
14 years 8 months ago
Efficiently computing private recommendations
Online recommender systems enable personalized service to users. The underlying collaborative filtering techniques operate on privacy sensitive user data, which could be misused ...
Zekeriya Erkin, M. Beye, T. Veugen, Reginald L. La...
MICCAI
2008
Springer
16 years 5 months ago
Exploring the Use of Proper Orthogonal Decomposition for Enhancing Blood Flow Images Via Computational Fluid Dynamics
Abstract. Obtaining high quality patient-specific flow velocity information is not an easy task. Available clinical data are usually poorly resolved and contain a significant amoun...
Dominik Szczerba, Gábor Székely, Kri...
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 4 months ago
Space-Efficient Online Computation of Quantile Summaries
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
Michael Greenwald, Sanjeev Khanna