4860 search results - page 373 / 972 » SNPs Problems, Complexity, and Algorithms |
122
Voted
TCOM
2011
14 years 10 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...
102
Voted
CRYPTO
2004
Springer
15 years 9 months 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...
150
Voted
ICML
2007
IEEE
16 years 4 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...
106
Voted
MOBIHOC
2003
ACM
16 years 3 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 ...
125
click to vote
IJCNN
2007
IEEE
15 years 10 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...