Sciweavers

699 search results - page 36 / 140
» The method of combinatorial telescoping
Sort
View
JMLR
2006
115views more  JMLR 2006»
13 years 8 months ago
Structured Prediction, Dual Extragradient and Bregman Projections
We present a simple and scalable algorithm for maximum-margin estimation of structured output models, including an important class of Markov networks and combinatorial models. We ...
Benjamin Taskar, Simon Lacoste-Julien, Michael I. ...
CVPR
2012
IEEE
11 years 11 months ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
SIAMSC
2010
210views more  SIAMSC 2010»
13 years 3 months ago
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, ea...
Ümit V. Çatalyürek, Cevdet Aykana...
FM
2006
Springer
127views Formal Methods» more  FM 2006»
14 years 4 days ago
Using Domain-Independent Problems for Introducing Formal Methods
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
Raymond T. Boute
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
14 years 1 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel