6110 search results - page 304 / 1222 » Approximate Computing |
171
click to vote
ASIACRYPT
2005
Springer
16 years 6 days 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 ...
181
click to vote
ESA
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
193
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated i...
153
click to vote
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
Computer vision requires the solution of many ill-posed problems such as optical flow, structure from motion, shape from shading, surface reconstruction, image restoration and ed...
172
click to vote
HICSS
1994
IEEE
15 years 10 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...