Sciweavers

221 search results - page 18 / 45
» Computing arbitrary functions of encrypted data
Sort
View
TCS
2008
13 years 7 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders
CGF
2010
111views more  CGF 2010»
13 years 7 months ago
Estimation and Modeling of Actual Numerical Errors in Volume Rendering
In this paper we study the comprehensive effects on volume rendered images due to numerical errors caused by the use of finite precision for data representation and processing. To...
Joel Kronander, Jonas Unger, Torsten Möller, ...
CVPR
2008
IEEE
14 years 9 months ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
CCS
1994
ACM
13 years 11 months ago
Application Access Control at Network Level
This paper describes an access control mechanism that enforces at the network level an access control decision that is taken at the application level. The mechanism is based on th...
Refik Molva, Erich Rütsche
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
13 years 11 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman