2089 search results - page 321 / 418 » A New Problem in String Searching |
TIP
1998
14 years 9 months ago
1998
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
IAT
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--Collaborating agents require either prior agreement on the shared vocabularies that they use for communication, or some means of translating between their private ontolog...
SCIA
2009
Springer
15 years 4 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
CPM
2005
Springer
14 years 12 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
COR
2007
14 years 10 months ago
2007
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...