Sciweavers

1445 search results - page 81 / 289
» Uniformly Hard Languages
Sort
View
ICFCA
2010
Springer
14 years 5 months ago
Approaches to the Selection of Relevant Concepts in the Case of Noisy Data
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...
Mikhail Klimushkin, Sergei A. Obiedkov, Camille Ro...
CP
2005
Springer
14 years 3 months ago
Lookahead Saturation with Restriction for SAT
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...
Anbulagan, John K. Slaney
CP
2005
Springer
14 years 3 months ago
Solving Over-Constrained Problems with SAT
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...
Josep Argelich, Felip Manyà
ERCIMDL
2000
Springer
246views Education» more  ERCIMDL 2000»
14 years 1 months ago
Automatic Web Rating: Filtering Obscene Content on the Web
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...
Konstantinos Chandrinos, Ion Androutsopoulos, Geor...
ICASSP
2009
IEEE
14 years 4 months ago
Filtering web text to match target genres
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...
Marius A. Marin, Sergey Feldman, Mari Ostendorf, M...