427 search results - page 74 / 86 » Content Search through Comparisons |
DAC
2001
ACM
15 years 10 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
86
Voted
ICS
2007
Tsinghua U.
15 years 3 months ago
2007
Tsinghua U.
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
This paper proposes a learning approach for the merging process in multilingual information retrieval (MLIR). To conduct the learning approach, we also present a large number of f...
72
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
CLEF
2009
Springer
14 years 10 months ago
2009
Springer
This paper describes the participation of LIG lab, in the batch filtering task for the INFILE (INformation FILtering Evaluation) campaign of CLEF 2009. As opposed to the online ta...