1021 search results - page 92 / 205 » Fast Approximate PCPs |
161
click to vote
ISAAC
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
136
click to vote
ACCV
2006
Springer
16 years 5 days ago
2006
Springer
We developed a system including two modules: the texture analysis module and the texture synthesis module. The analysis module is capable of analyzing an input image and performing...
182
click to vote
DAC
2006
ACM
2006
ACM
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming
16 years 5 days ago
We propose a novel and efficient charge-based decoupling capacitance budgeting algorithm. Our method uses the macromodeling technique and effective radius of decoupling capacitan...
200
click to vote
ACIVS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we present a new implementation of a rainfalling watershed segmentation algorithm. Our previous algorithm was a one-run algorithm. All the steps needed to c...
164
click to vote
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...