Sciweavers

2231 search results - page 258 / 447
» Alternation as a programming paradigm
Sort
View
149
Voted
JMLR
2006
115views more  JMLR 2006»
15 years 6 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. ...
EOR
2007
93views more  EOR 2007»
15 years 6 months ago
An integrated approach for deriving priorities in analytic network process
A multiple objective programming approach for the analytic network process (ANP) is proposed to obtain all local priorities for crisp or interval judgments at one time, even in an...
Jing-Rung Yu, Sheu-Ji Cheng
DAM
2002
135views more  DAM 2002»
15 years 6 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
ENTCS
2002
91views more  ENTCS 2002»
15 years 6 months ago
Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the...
Brigitte Pientka
176
Voted

Publication
433views
16 years 3 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre