Sciweavers

3241 search results - page 433 / 649
» Challenges for Dataset Search
Sort
View
C3S2E
2010
ACM
15 years 7 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
CLEF
2010
Springer
15 years 7 months ago
Language Identification Strategies for Cross Language Information Retrieval
In our participation to the 2010 LogCLEF track we focused on the analysis of the European Library (TEL) logs and in particular we experimented with the identification of the natura...
Alessio Bosca, Luca Dini
CIKM
2010
Springer
15 years 5 months ago
A cross-lingual framework for monolingual biomedical information retrieval
An important challenge for biomedical information retrieval (IR) is dealing with the complex, inconsistent and ambiguous biomedical terminology. Frequently, a concept-based repres...
Dolf Trieschnigg, Djoerd Hiemstra, Franciska de Jo...
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 5 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
SIGKDD
2010
125views more  SIGKDD 2010»
15 years 1 months ago
A framework for mining interesting pattern sets
This paper suggests a framework for mining subjectively interesting pattern sets that is based on two components: (1) the encoding of prior information in a model for the data min...
Tijl De Bie, Kleanthis-Nikolaos Kontonasios, Eirin...