Sciweavers

244 search results - page 20 / 49
» Generalized RANSAC Framework for Relaxed Correspondence Prob...
Sort
View
JMLR
2010
115views more  JMLR 2010»
13 years 6 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
ECOOPW
1999
Springer
13 years 11 months ago
Deriving Object-Oriented Frameworks from Domain Knowledge
Although a considerable number of successful frameworks have been developed during the last decade, designing a high-quality framework is still a difficult task. Generally, it is ...
Mehmet Aksit
BMCBI
2011
13 years 2 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 ...
KAIS
2006
172views more  KAIS 2006»
13 years 7 months ago
CoMMA: a framework for integrated multimedia mining using multi-relational associations
Generating captions or annotations automatically for still images is a challenging task. Traditionally, techniques involving higher-level (semantic) object detection and complex f...
Ankur Teredesai, Muhammad A. Ahmad, Juveria Kanodi...
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
13 years 9 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella