Sciweavers

518 search results - page 99 / 104
» Beating a Random Assignment
Sort
View
JMLR
2008
150views more  JMLR 2008»
15 years 2 months ago
Discriminative Learning of Max-Sum Classifiers
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...
Vojtech Franc, Bogdan Savchynskyy
120
Voted
JCB
2006
123views more  JCB 2006»
15 years 2 months ago
Reconstructing Ancestral Haplotypes with a Dictionary Model
We propose a dictionary model for haplotypes. According to the model, a haplotype is constructed by randomly concatenating haplotype segments from a given dictionary of segments. ...
Kristin L. Ayers, Chiara Sabatti, Kenneth Lange
JMLR
2006
389views more  JMLR 2006»
15 years 2 months ago
A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis
This paper introduces a learning method for two-layer feedforward neural networks based on sensitivity analysis, which uses a linear training algorithm for each of the two layers....
Enrique Castillo, Bertha Guijarro-Berdiñas,...
AI
2005
Springer
15 years 2 months ago
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
Zhao Xing, Weixiong Zhang
TCOM
2008
115views more  TCOM 2008»
15 years 2 months ago
Differentiated rate scheduling for the down-link of cellular systems
We consider the problem of differentiated rate scheduling for the downlink (i.e., multi-antenna broadcast channel), in the sense that the rates required by different users must sat...
Amir F. Dana, Masoud Sharif, Ali Vakili, Babak Has...