Sciweavers

3818 search results - page 332 / 764
» Word Problems on Compressed Words
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Connectionist temporal classification: labelling unsegmented sequence data with recurrent neural networks
Many real-world sequence learning tasks require the prediction of sequences of labels from noisy, unsegmented input data. In speech recognition, for example, an acoustic signal is...
Alex Graves, Faustino J. Gomez, Jürgen Schmid...
ICML
2006
IEEE
16 years 7 months ago
An intrinsic reward mechanism for efficient exploration
How should a reinforcement learning agent act if its sole purpose is to efficiently learn an optimal policy for later use? In other words, how should it explore, to be able to exp...
Özgür Simsek, Andrew G. Barto
WWW
2007
ACM
16 years 7 months ago
Towards extracting flickr tag semantics
We address the problem of extracting semantics of tags ? short, unstructured text-labels assigned to resources on the Web ? based on each tag's metadata patterns. In particul...
Tye Rattenbury, Nathan Good, Mor Naaman
PADL
2009
Springer
16 years 7 months ago
Recycle Your Arrays!
Abstract. Purely functional arrays are notoriously difficult to implement and use efficiently due to the absence of destructive updates and the resultant frequent copying. Deforest...
Roman Leshchinskiy
STOC
2009
ACM
182views Algorithms» more  STOC 2009»
16 years 7 months ago
Approximating edit distance in near-linear time
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
Alexandr Andoni, Krzysztof Onak