Sciweavers

915 search results - page 90 / 183
» Maximally Abstract Retrenchments
Sort
View
STRINGOLOGY
2008
13 years 9 months ago
Conservative String Covering of Indeterminate Strings
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
Pavlos Antoniou, Maxime Crochemore, Costas S. Ilio...
ESANN
2006
13 years 9 months ago
Consistent estimation of the architecture of multilayer perceptrons
Abstract. We consider regression models involving multilayer perceptrons (MLP) with one hidden layer and a Gaussian noise. The estimation of the parameters of the MLP can be done b...
Joseph Rynkiewicz
DICTA
2003
13 years 9 months ago
Image Ownership Verification via Private Pattern and Watermarking Wavelet Filters
Abstract. In this paper, we propose a watermarking scheme for the image ownership verification in terms of a private key pattern and wavelet filters. The watermarking is mainly ach...
Zhuan Qing Huang, Zhuhan Jiang
WCET
2003
13 years 9 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper
NIPS
1994
13 years 9 months ago
Finding Structure in Reinforcement Learning
Reinforcement learning addresses the problem of learning to select actions in order to maximize one's performance inunknownenvironments. Toscale reinforcement learning to com...
Sebastian Thrun, Anton Schwartz