Sciweavers

6095 search results - page 269 / 1219
» Learning in Local Search
Sort
View
ICASSP
2008
IEEE
16 years 1 months ago
Admissible stopping in viterbi beam search for unit selection in concatenative speech synthesis
Corpus-based concatenative speech synthesis is very popular these days due to its highly natural speech quality. The amount of computation required in the run time, however, is of...
Shinichi Sakai, Tatsuya Kawahara, Shun Nakamura
DEXA
2006
Springer
190views Database» more  DEXA 2006»
15 years 10 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
JCO
1998
136views more  JCO 1998»
15 years 6 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
CIKM
2009
Springer
16 years 1 months ago
Agglomerating local patterns hierarchically with ALPHA
To increase the relevancy of local patterns discovered from noisy relations, it makes sense to formalize error-tolerance. Our starting point is to address the limitations of state...
Loïc Cerf, Pierre-Nicolas Mougel, Jean-Fran&c...
ICAPR
2009
Springer
16 years 1 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri