848 search results - page 141 / 170 » Randomness and the linear degrees of computability |
146
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
168
click to vote
JMLR
2008
15 years 5 months ago
2008
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
194
click to vote
TSP
2010
15 years 6 days ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
170
click to vote
CISS
2007
IEEE
15 years 12 months ago
2007
IEEE
— In wireless ad hoc networks, distributed nodes can collaboratively form an antenna array for long-distance communications to achieve high energy efficiency. In recent work, Oc...
154
click to vote
DAWAK
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Pearson product-moment correlation coefficients are a wellpracticed quantification of linear dependence seen across many fields. When calculating a sample-based correlati...