Sciweavers

1813 search results - page 91 / 363
» Instance Pruning Techniques
Sort
View
DASFAA
2010
IEEE
191views Database» more  DASFAA 2010»
15 years 4 months ago
Answering Top-k Similar Region Queries
Abstract. Advances in web technology have given rise to new information retrieval applications. In this paper, we present a model for geographical region search and call this class...
Chang Sheng, Yu Zheng, Wynne Hsu, Mong-Li Lee, Xin...
ICASSP
2010
IEEE
15 years 4 months ago
Language model adaptation using Random Forests
In this paper we investigate random forest based language model adaptation. Large amounts of out-of-domain data are used to grow the decision trees while very small amounts of in-...
Anoop Deoras, Frederick Jelinek, Yi Su
FUIN
2007
90views more  FUIN 2007»
15 years 4 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier
TCS
2008
15 years 4 months ago
Loop detection in term rewriting using the eliminating unfoldings
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...
Étienne Payet
CG
2002
Springer
15 years 4 months ago
A Comparison of Algorithms for Multi-player Games
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
Nathan R. Sturtevant