Sciweavers

2519 search results - page 53 / 504
» cost 2007
Sort
View
NIPS
2004
15 years 7 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg
COST
2007
Springer
95views Multimedia» more  COST 2007»
16 years 11 days ago
On the Use of NonVerbal Speech Sounds in Human Communication
Recent work investigating the interaction of the speech signal with the meaning of the verbal content has revealed interactions not yet modelled in either speech recognition techn...
Nick Campbell
TSD
2007
Springer
16 years 9 days ago
Quality Deterioration Factors in Unit Selection Speech Synthesis
Abstract. The purpose of the present paper is to examine the relationships between target and concatenation costs and the quality (with focus on naturalness) of generated speech. S...
Daniel Tihelka, Jindrich Matousek, Jirí Kal...
ASIAMS
2007
IEEE
16 years 16 days ago
Broadcasting in (n, k)-Arrangement Graph Based on an Optimal Spanning Tree
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
Jingli Li, Yonghong Xiang, Manli Chen, Yongheng Zh...
CORR
2007
Springer
77views Education» more  CORR 2007»
15 years 6 months ago
Query Evaluation and Optimization in the Semantic Web
We address the problem of answering Web ontology queries efficiently. An ontology is formalized as a Deductive Ontology Base (DOB), a deductive database that comprises the ontology...
Edna Ruckhaus, Eduardo Ruiz, Maria-Esther Vidal