Sciweavers

2415 search results - page 324 / 483
» Markov Processes on Curves
Sort
View
TCS
2008
13 years 9 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
IOR
2007
82views more  IOR 2007»
13 years 9 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...
JSAC
2007
73views more  JSAC 2007»
13 years 9 months ago
Optimal Wavelength Sharing Policies in OBS Networks Subject to QoS Constraints
— We consider the general problem of optimizing the performance of OBS networks with multiple traffic classes subject to strict (absolute) QoS constraints in terms of the end-to...
Li Yang, George N. Rouskas
CORR
2000
Springer
129views Education» more  CORR 2000»
13 years 8 months ago
Prosody-Based Automatic Segmentation of Speech into Sentences and Topics
A crucial step in processing speech audio data for information extraction, topic detection, or browsing/playback is to segment the input into sentence and topic units. Speech segm...
Elizabeth Shriberg, Andreas Stolcke, Dilek Z. Hakk...
CSL
2002
Springer
13 years 8 months ago
Transformation streams and the HMM error model
The most popular model used in automatic speech recognition is the hidden Markov model (HMM). Though good performance has been obtained with such models there are well known limit...
M. J. F. Gales