Sciweavers

429 search results - page 60 / 86
» Noisy Turing Machines
Sort
View
ACL
2008
14 years 11 months ago
Decompounding query keywords from compounding languages
Splitting compound words has proved to be useful in areas such as Machine Translation, Speech Recognition or Information Retrieval (IR). Furthermore, real-time IR systems (such as...
Enrique Alfonseca, Slaven Bilac, Stefan Pharies
ESANN
2006
14 years 11 months ago
Using sampling methods to improve binding site predictions
Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. In previous work we combine random selection under-sampling with th...
Yi Sun, Mark Robinson, Rod Adams, Rene te Boekhors...
CP
2000
Springer
15 years 1 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
AC
1998
Springer
14 years 9 months ago
Cellular Automata Models of Self-Replicating Systems
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn
ICML
2008
IEEE
15 years 10 months ago
Training SVM with indefinite kernels
Similarity matrices generated from many applications may not be positive semidefinite, and hence can't fit into the kernel machine framework. In this paper, we study the prob...
Jianhui Chen, Jieping Ye