Sciweavers

5100 search results - page 703 / 1020
» The Linear Complexity of a Graph
Sort
View
CSL
2008
Springer
15 years 8 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
EWRL
2008
15 years 8 months ago
Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
Kirill Dyagilev, Shie Mannor, Nahum Shimkin
ICISC
2007
117views Cryptology» more  ICISC 2007»
15 years 8 months ago
Side Channel Attacks on Irregularly Decimated Generators
Abstract. We investigate three side channel attacks on ABSG, a variant of irregularly decimated generators (IDG). The three attacks are timing analysis, phase-shift fault analysis ...
Chuan-Wen Loe, Khoongming Khoo
IPCO
2008
114views Optimization» more  IPCO 2008»
15 years 8 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi
ICONIP
2007
15 years 8 months ago
Principal Component Analysis for Sparse High-Dimensional Data
Abstract. Principal component analysis (PCA) is a widely used technique for data analysis and dimensionality reduction. Eigenvalue decomposition is the standard algorithm for solvi...
Tapani Raiko, Alexander Ilin, Juha Karhunen