152 search results - page 23 / 31 » An Experimental Study of Random Knapsack Problems |
CP
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
LREC
2010
13 years 8 months ago
2010
Automatic acquisition of novel compounds is notoriously difficult because most novel compounds have relatively low frequency in a corpus. The current study proposes a new method t...
AAAI
2004
13 years 8 months ago
2004
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
NIPS
2003
13 years 8 months ago
2003
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
This paper presents a Markov Random Field (MRF)-based approach for depth map super-resolution and enhancement. Given a low-resolution or moderate quality depth map, we study the p...