Sciweavers

848 search results - page 50 / 170
» Randomness and the linear degrees of computability
Sort
View
TIT
2008
103views more  TIT 2008»
15 years 4 months ago
Fast Distributed Algorithms for Computing Separable Functions
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...
Damon Mosk-Aoyama, Devavrat Shah
FOCS
2002
IEEE
15 years 9 months ago
Learning a Hidden Matching
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...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...
CVPR
2001
IEEE
16 years 6 months ago
A New 3-D Pattern Recognition Technique With Application to Computer Aided Colonoscopy
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...
Salih Burak Göktürk, Carlo Tomasi
STOC
1995
ACM
126views Algorithms» more  STOC 1995»
15 years 7 months ago
A computational view of population genetics
This paper contributes tothe study of nonlinear dynamical systems from a computational perspective. These systems are inherently more powerful than their linear counterparts (such...
Yuval Rabani, Yuri Rabinovich, Alistair Sinclair
ASIACRYPT
2005
Springer
15 years 9 months ago
Fast Computation of Large Distributions and Its Cryptographic Applications
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 ...
Alexander Maximov, Thomas Johansson