7129 search results - page 521 / 1426 » Approximation Algorithms for Treewidth |
226
click to vote
EMNLP
2006
15 years 8 months ago
2006
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
186
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
259
click to vote
COCOON
2010
Springer
15 years 5 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
236
click to vote
FOGA
2011
14 years 10 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
217
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...