Sciweavers

24529 search results - page 337 / 4906
» Computing on Authenticated Data
Sort
View
PODS
2004
ACM
130views Database» more  PODS 2004»
16 years 4 months ago
Computational Complexity of Itemset Frequency Satisfiability
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...
Toon Calders
WSC
2008
15 years 6 months ago
Solving volume and capacity planning problems in semiconductor manufaturing: A computational study
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...
Christoph Habla, Lars Mönch
EUNIS
2001
15 years 5 months ago
High Performance Computing in Europe and USA: A Comparison
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)...
Erich Strohmaier, Hans Werner Meuer
CCGRID
2008
IEEE
15 years 10 months ago
A Proactive Non-Cooperative Game-Theoretic Framework for Data Replication in Data Grids
— Data grids and its cost effective nature has taken on a new level of interest in recent years; amalgamation of different providers results in increased capacity as well as lowe...
Ali Elghirani, Riky Subrata, Albert Y. Zomaya
GRC
2008
IEEE
15 years 5 months ago
Towards Real-time Performance of Data Value Hiding for Frequent Data Updates
Hiding data values in privacy-preserving data mining (PPDM) protects information against unauthorized attacks while maintaining analytical data properties. The most popular models...
Jie Wang, Justin Zhan, Jun Zhang