Sciweavers

4908 search results - page 949 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ISCA
1996
IEEE
126views Hardware» more  ISCA 1996»
15 years 4 months ago
Memory Bandwidth Limitations of Future Microprocessors
This paper makes the case that pin bandwidth will be a critical consideration for future microprocessors. We show that many of the techniques used to tolerate growing memory laten...
Doug Burger, James R. Goodman, Alain Kägi
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 3 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
NATO
1993
15 years 3 months ago
METU Object-Oriented DBMS
METU Object-Oriented DBMS 1 includes the implementation of a database kernel, an object-oriented SQL-like language and a graphical user interface. Kernel functions are divided bet...
Asuman Dogac, Cetin Ozkan, Ismailcem Budak Arpinar...
POPL
1994
ACM
15 years 3 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
EDBT
1990
ACM
108views Database» more  EDBT 1990»
15 years 3 months ago
Deductive Databases - Theory Meets Practice
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
Carlo Zaniolo