Sciweavers

5595 search results - page 396 / 1119
» Comparing Subsumption Optimizations
Sort
View
CPM
2007
Springer
73views Combinatorics» more  CPM 2007»
15 years 10 months ago
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
Travis Gagie, Giovanni Manzini
EXPCS
2007
15 years 10 months ago
Performance testing of combinatorial solvers with isomorph class instances
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
Franc Brglez, Jason A. Osborne
CASES
2004
ACM
15 years 10 months ago
Scalable custom instructions identification for instruction-set extensible processors
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
Pan Yu, Tulika Mitra
MCS
2000
Springer
15 years 10 months ago
A Hybrid Projection Based and Radial Basis Function Architecture
We introduce a mechanism for constructing and training a hybrid architecture of projection based units and radial basis functions. In particular, we introduce an optimization sche...
Shimon Cohen, Nathan Intrator
185
Voted
TREC
2008
15 years 8 months ago
External Query Expansion in the Blogosphere
: We describe the participation of the University of Amsterdam's ILPS group in the blog track at TREC 2008. We mainly explored different ways of using external corpora to expa...
Wouter Weerkamp, Maarten de Rijke