Sciweavers

27 search results - page 1 / 6
» Optimal Sherali-Adams Gaps from Pairwise Independence
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
13 years 11 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
BMCBI
2011
12 years 11 months ago
Screening synteny blocks in pairwise genome comparisons through integer programming
Background: It is difficult to accurately interpret chromosomal correspondences such as true orthology and paralogy due to significant divergence of genomes from a common ancestor...
Haibao Tang, Eric Lyons, Brent S. Pedersen, James ...
BMCBI
2006
139views more  BMCBI 2006»
13 years 4 months ago
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise li
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
Shinsuke Yamada, Osamu Gotoh, Hayato Yamana
SIGIR
2008
ACM
13 years 4 months ago
Learning to reduce the semantic gap in web image retrieval and annotation
We study in this paper the problem of bridging the semantic gap between low-level image features and high-level semantic concepts, which is the key hindrance in content-based imag...
Changhu Wang, Lei Zhang 0001, Hong-Jiang Zhang
CVIU
2008
109views more  CVIU 2008»
13 years 4 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios