4163 search results - page 266 / 833 » A comprehensive combination framework |
177
click to vote
KI
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
205
click to vote
RECOMB
1999
Springer
15 years 10 months ago
1999
Springer
The abundance of information provided by completely sequenced genomes de nes a starting point for new insights in the multilevel organization of organisms and their evolution. At ...
194
click to vote
ECAI
1990
Springer
15 years 10 months ago
1990
Springer
In case-based reasoning (CBR) a problem is solved by matching the problem description to a previously solved case, using the past solution in solving the new problem. A case-based...
190
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
183
click to vote
CICLING
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we address both standard and focused retrieval tasks based on comprehensible language models and interactive query expansion (IQE). Query topics are expanded using a...