848 search results - page 50 / 170 » Randomness and the linear degrees of computability |
TIT
2008
14 years 11 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
135
click to vote
CVPR
2001
IEEE
16 years 1 months ago
2001
IEEE
To utilize CT or MRI images for computer aided diagnosis applications, robust features that represent 3-D image data need to be constructed and subsequently used by a classificati...
STOC
1995
ACM
15 years 3 months ago
1995
ACM
This paper contributes tothe study of nonlinear dynamical systems from a computational perspective. These systems are inherently more powerful than their linear counterparts (such...
ASIACRYPT
2005
Springer
15 years 5 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 ...