Sciweavers

3270 search results - page 64 / 654
» Approximate String Processing
Sort
View
IJCAI
2001
13 years 9 months ago
An Improved Grid-Based Approximation Algorithm for POMDPs
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
Rong Zhou, Eric A. Hansen
BTW
2009
Springer
145views Database» more  BTW 2009»
14 years 2 months ago
Towards web Supported Identification of Top Affiliations from Scholarly Papers
: Frequent successful publications by specific institutions are indicators for identifying outstanding centres of research. This institution data are present in scholarly papers as...
David Aumüller
IJFCS
2006
87views more  IJFCS 2006»
13 years 7 months ago
Flexible Music Retrieval in Sublinear Time
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...
PPAM
2005
Springer
14 years 1 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
14 years 27 days ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk