Sciweavers

215 search results - page 40 / 43
» On the Linear Number of Matching Substrings
Sort
View
DAM
2011
13 years 2 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
TASLP
2010
130views more  TASLP 2010»
13 years 1 months ago
Developing Objective Measures of Foreign-Accent Conversion
Various methods have recently appeared to transform foreign-accented speech into its native-accented counterpart. Evaluation of these accent conversion methods requires extensive l...
Daniel Felps, Ricardo Gutierrez-Osuna
ECCV
2004
Springer
14 years 9 months ago
Camera Calibration from the Quasi-affine Invariance of Two Parallel Circles
Abstract. In this paper, a new camera calibration algorithm is proposed, which is from the quasi-affine invariance of two parallel circles. Two parallel circles here mean two circl...
Yihong Wu, Haijiang Zhu, Zhanyi Hu, Fuchao Wu
WWW
2007
ACM
14 years 7 months ago
Preference-based selection of highly configurable web services
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 7 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys