Sciweavers

450 search results - page 63 / 90
» Satisfiability with Exponential Families
Sort
View
101
Voted
NIPS
2008
15 years 1 months ago
On the Efficient Minimization of Classification Calibrated Surrogates
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...
Richard Nock, Frank Nielsen
CORR
2008
Springer
128views Education» more  CORR 2008»
14 years 12 months ago
Diversity-Multiplexing Tradeoff in Selective-Fading Multiple-Access MIMO Channels
We establish the optimal diversity-multiplexing (DM) tradeoff of coherent selective-fading multiple-access multiple-input multiple-output (MIMO) channels and provide corresponding ...
Pedro Coronel, Markus Gärtner, Helmut Bö...
CORR
2006
Springer
127views Education» more  CORR 2006»
14 years 12 months ago
Space Division Multiple Access with a Sum Feedback Rate Constraint
On a multiantenna broadcast channel, simultaneous transmission to multiple users by joint beamforming and scheduling is capable of achieving high throughput, which grows double log...
Kaibin Huang, Robert W. Heath Jr., Jeffrey G. Andr...
FMSD
2006
104views more  FMSD 2006»
14 years 11 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
AI
1999
Springer
14 years 11 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle