Sciweavers

441 search results - page 10 / 89
» Optimal Subsequence Bijection
Sort
View
SIAMDM
1998
89views more  SIAMDM 1998»
14 years 9 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
TKDE
2012
245views Formal Methods» more  TKDE 2012»
13 years 15 hour ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
ORL
2006
87views more  ORL 2006»
14 years 9 months ago
SPAR: stochastic programming with adversarial recourse
We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We int...
Matthew D. Bailey, Steven M. Shechter, Andrew J. S...
83
Voted
FMSD
2008
94views more  FMSD 2008»
14 years 9 months ago
Optimal infinite scheduling for multi-priced timed automata
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larse...
ICASSP
2008
IEEE
15 years 4 months ago
Parsing-based objective functions for speech recognition in translation applications
This paper looks at a parsing-based alternative to word error rate (WER) for optimizing recognition, SParseval, hypothesizing that it may be a better objective for applications su...
Dustin Hillard, Mei-Yuh Hwang, Mary P. Harper, Mar...