Sciweavers

699 search results - page 32 / 140
» The method of combinatorial telescoping
Sort
View
EMNLP
2011
12 years 8 months ago
Dual Decomposition with Many Overlapping Components
Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are ...
André L. Martins, Noah A. Smith, Már...
STACS
2007
Springer
14 years 2 months ago
Cost Sharing Methods for Makespan and Completion Time Scheduling
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...
Janina A. Brenner, Guido Schäfer
ML
2002
ACM
128views Machine Learning» more  ML 2002»
13 years 8 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
ICANN
2009
Springer
14 years 1 months ago
A Two Stage Clustering Method Combining Self-Organizing Maps and Ant K-Means
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
Jefferson R. Souza, Teresa Bernarda Ludermir, Lean...
IPPS
2003
IEEE
14 years 1 months ago
Accurate Method for Fast Design of Diagnostic Oligonucleotide Probe Sets for DNA Microarrays
We present a method for the automatic generation of oligonucleotide probe sets for DNA microarrays. This approach is well suited particularly for specificity evaluation of design...
Andreas Krause, Markus Kräutner, Harald Meier