Sciweavers

2300 search results - page 194 / 460
» Maximally Concurrent Programs
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
Large margin estimation of n-gram language models for speech recognition via linear programming
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
Vladimir Magdin, Hui Jiang
EM
2010
134views Management» more  EM 2010»
15 years 6 months ago
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
Abstract. The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and...
Hans D. Mittelmann, Frank Vallentin
IIE
2006
183views more  IIE 2006»
15 years 6 months ago
Desktop Tools for Offline Plagiarism Detection in Computer Programs
Plagiarism in universities has always been a difficult problem to overcome. Various tools have been developed over the past few years to help teachers detect plagiarism in students...
Maxim Mozgovoy
TPDS
2008
64views more  TPDS 2008»
15 years 6 months ago
Linear Programming-Based Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems
Abstract-- Resource management systems (RMS) are an important component in heterogeneous computing (HC) systems. One of the jobs of an RMS is the mapping of arriving tasks onto the...
Issam Al-Azzoni, Douglas G. Down
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 5 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
Ido Tal, Ron M. Roth