837 search results - page 40 / 168 » Hard combinators |
128
click to vote
JMLR
2012
13 years 2 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
AAAI
2012
13 years 2 months ago
2012
Real-time transcription provides deaf and hard of hearing people visual access to spoken content, such as classroom instruction, and other live events. Currently, the only reliabl...
NN
2006
Springer
14 years 11 months ago
2006
Springer
Modular model is a particular type of committee machine and is comprised of a set of specialized (local) models each of which is responsible for a particular region of the input s...
ICTAI
1999
IEEE
15 years 4 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
ASIACRYPT
2009
Springer
15 years 6 months ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...