24188 search results - page 313 / 4838 » Computing on Encrypted Data |
130
click to vote
MICCAI
2008
Springer
16 years 5 months ago
2008
Springer
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...
114
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
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...
127
Voted
PODS
2004
ACM
16 years 4 months ago
2004
ACM
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
140
click to vote
WSC
2008
15 years 6 months ago
2008
In this paper, we suggest a linear programming formulation that allows for solving volume and capacity planning problems in semiconductor manufacturing systems. We assume a genera...
106
Voted
EUNIS
2001
15 years 5 months ago
2001
Since 1993 we compile and publish twice a year a list of the mostpowerful supercomputers in the world. In this article we compare the situation of High-Performance Computing (HPC)...