Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic translation models. We present an alternative ap...
Abhishek Arun, Barry Haddow, Philipp Koehn, Adam L...
Sponsored search is a multi-billion dollar business that generates most of the revenue for search engines. Predicting the probability that users click on ads is crucial to sponsor...
Traditional n-gram language models are widely used in state-of-the-art large vocabulary speech recognition systems. This simple model suffers from some limitations, such as overfi...
Abstract. Our goal is to extract consistent bits from the same fingerprint in a noisy environment. Such bits can then be used as a secret key in several cryptographic applications...