85
Voted
INTERSPEECH
2010
14 years 7 months ago
2010
The paper presents an in-depth analysis of a less known interaction between Kneser-Ney smoothing and entropy pruning that leads to severe degradation in language model performance...
INTERSPEECH
2010
14 years 7 months ago
2010
The search for the optimal word sequence can be performed efficiently even in a speech recognizer with a very large vocabulary and complex models. This is achieved using pruning m...
109
Voted
COLING
2010
14 years 7 months ago
2010
Given the increasing need to process massive amounts of textual data, efficiency of NLP tools is becoming a pressing concern. Parsers based on lexicalised grammar formalisms, such...
109
click to vote
AUSAI
2010
Springer
14 years 10 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
126
Voted
ACIVS
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
85
Voted
WEBI
2010
Springer
14 years 10 months ago
2010
Springer
Static index pruning techniques aim at removing from the posting lists of an inverted file the references to documents which are likely to be not relevant for answering user querie...
109
Voted
PVLDB
2010
14 years 11 months ago
2010
Set similarity join has played an important role in many real-world applications such as data cleaning, near duplication detection, data integration, and so on. In these applicati...
112
Voted
AI
1998
Springer
15 years 7 days ago
1998
Springer
The Multi-model search framework generalizes minimax to allow exploitation of recursive opponent models. In this work we consider adding pruning to the multi-model search. We prov...
96
Voted
NETWORKS
2008
15 years 14 days ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
101
Voted
DISOPT
2007
15 years 15 days ago
2007
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....