Sciweavers

1100 search results - page 193 / 220
» Approximate distance oracles
Sort
View
COLT
2010
Springer
14 years 8 months ago
Efficient Classification for Metric Data
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...
Lee-Ad Gottlieb, Leonid Kontorovich, Robert Krauth...
EMNLP
2009
14 years 7 months ago
Projecting Parameters for Multilingual Word Sense Disambiguation
We report in this paper a way of doing Word Sense Disambiguation (WSD) that has its origin in multilingual MT and that is cognizant of the fact that parallel corpora, wordnets and...
Mitesh M. Khapra, Sapan Shah, Piyush Kedia, Pushpa...
EVOW
2009
Springer
14 years 7 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
INTERSPEECH
2010
14 years 4 months ago
On the relation of Bayes risk, word error, and word posteriors in ASR
In automatic speech recognition, we are faced with a wellknown inconsistency: Bayes decision rule is usually used to minimize sentence (word sequence) error, whereas in practice w...
Ralf Schlüter, Markus Nußbaum-Thom, Her...
JGO
2010
100views more  JGO 2010»
14 years 4 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti