Sciweavers

INTERSPEECH
2010
13 years 5 months ago
Study on interaction between entropy pruning and kneser-ney smoothing
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...
Ciprian Chelba, Thorsten Brants, Will Neveitt, Pen...
INTERSPEECH
2010
13 years 5 months ago
Direct observation of pruning errors (DOPE): a search analysis tool
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...
Volker Steinbiss, Martin Sundermeyer, Hermann Ney
COLING
2010
13 years 5 months ago
Chart Pruning for Fast Lexicalised-Grammar Parsing
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...
Yue Zhang 0004, Byung-Gyu Ahn, Stephen Clark, Curt...
AUSAI
2010
Springer
13 years 8 months ago
A Heuristic on Effective and Efficient Clustering on Uncertain Objects
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...
Edward Hung, Lei Xu, Chi-Cheong Szeto
ACIVS
2009
Springer
13 years 8 months ago
Enhanced Low-Resolution Pruning for Fast Full-Search Template Matching
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...
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
WEBI
2010
Springer
13 years 8 months ago
On Using Query Logs for Static Index Pruning
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...
Hoang Thanh Lam, Raffaele Perego, Fabrizio Silvest...
PVLDB
2010
126views more  PVLDB 2010»
13 years 9 months ago
Set Similarity Join on Probabilistic Data
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...
Xiang Lian, Lei Chen 0002
AI
1998
Springer
13 years 10 months ago
Pruning Algorithms for Multi-Model Adversary Search
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...
David Carmel, Shaul Markovitch
NETWORKS
2008
13 years 10 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
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...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
DISOPT
2007
81views more  DISOPT 2007»
13 years 11 months ago
Strong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
Luc Mercier, Pascal Van Hentenryck