Sciweavers

221 search results - page 18 / 45
» New formulations for the Kissing Number Problem
Sort
View
96
Voted
ICML
2007
IEEE
15 years 10 months ago
Hierarchical maximum entropy density estimation
We study the problem of simultaneously estimating several densities where the datasets are organized into overlapping groups, such as a hierarchy. For this problem, we propose a m...
David M. Blei, Miroslav Dudík, Robert E. Sc...
RECOMB
2010
Springer
15 years 4 months ago
On the Genealogy of Asexual Diploids
Given molecular genetic data from diploid individuals that, at present, reproduce mostly or exclusively asexually without recombination, an important problem in evolutionary biolog...
Fumei Lam, Charles H. Langley, Yun S. Song
INFOCOM
2010
IEEE
14 years 8 months ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
15 years 3 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
COLT
2003
Springer
15 years 2 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan