4860 search results - page 373 / 972 » SNPs Problems, Complexity, and Algorithms |
167
click to vote
TCOM
2011
15 years 1 months ago
2011
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...
157
click to vote
CRYPTO
2004
Springer
16 years 3 days ago
2004
Springer
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
188
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
142
Voted
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
171
click to vote
IJCNN
2007
IEEE
16 years 1 months ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...