1445 search results - page 81 / 289 » Uniformly Hard Languages |
111
Voted
ICFCA
2010
Springer
15 years 10 months ago
2010
Springer
Concept lattices built on noisy data tend to be large and hence hard to interpret. We introduce several measures that can be used in selecting relevant concepts and discuss how the...
78
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report o...
137
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
122
Voted
ERCIMDL
2000
Springer
15 years 7 months ago
2000
Springer
We present a method to detect automatically pornographic content on the Web. Our method combines techniques from language engineering and image analysis within a machine-learning f...
137
Voted
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
In language modeling for speech recognition, both the amount of training data and the match to the target task impact the goodness of the model, with the trade-off usually favorin...