129 search results - page 17 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
TIT
2008
13 years 8 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...
ICIP
2008
IEEE
14 years 2 months ago
2008
IEEE
Due to their ease of use and availability, pan-tilt-zoom (PTZ) cameras are everywhere. However, in order to utilize these cameras for a meaningful application, it is necessary tha...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
JMLR
2012
11 years 11 months ago
2012
We transform the outputs of each hidden neuron in a multi-layer perceptron network to have zero output and zero slope on average, and use separate shortcut connections to model th...