Sciweavers

71 search results - page 6 / 15
» Computationally Private Randomizing Polynomials and Their Ap...
Sort
View
ICDE
2007
IEEE
140views Database» more  ICDE 2007»
14 years 8 months ago
Selecting Stars: The k Most Representative Skyline Operator
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang
DAC
2008
ACM
14 years 8 months ago
The synthesis of robust polynomial arithmetic with stochastic logic
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challeng...
Weikang Qian, Marc D. Riedel
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 8 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
IACR
2011
94views more  IACR 2011»
12 years 7 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
CP
2001
Springer
13 years 12 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi