5595 search results - page 461 / 1119 » Approximation Algorithms for Clustering Problems |
258
Voted
CORR
2012
Springer
14 years 3 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
208
click to vote
IPPS
2000
IEEE
15 years 12 months ago
2000
IEEE
Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is...
212
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
190
click to vote
AAAI
2006
15 years 9 months ago
2006
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
229
click to vote
LION
2009
Springer
16 years 2 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...