Performance of n-gram language models depends to a large extent on the amount of training text material available for building the models and the degree to which this text matches...
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Rober...
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Abstract. Over the past few years researchers have been investigating the enhancement of visual tracking performance by devising trackers that simultaneously make use of several di...
In this paper we study a new framework introduced by Vapnik (1998) and Vapnik (2006) that is an alternative capacity concept to the large margin approach. In the particular case o...