Sciweavers

2925 search results - page 207 / 585
» Information Complexity of Online Problems
Sort
View
ESANN
2007
15 years 8 months ago
Intrinsic plasticity for reservoir learning algorithms
One of the most difficult problems in using dynamic reservoirs like echo state networks for signal processing is the choice of reservoir network parameters like connectivity or spe...
Marion Wardermann, Jochen J. Steil
DEDS
2010
88views more  DEDS 2010»
15 years 6 months ago
Optimal Admission Control of Discrete Event Systems with Real-Time Constraints
Abstract-- The problem of optimally controlling the processing rate of tasks in Discrete Event Systems (DES) with hard real-time constraints has been solved in [9] under the assump...
Jianfeng Mao, Christos G. Cassandras
CVPR
2012
IEEE
13 years 9 months ago
Memory constrained face recognition
Real-time recognition may be limited by scarce memory and computing resources for performing classification. Although, prior research has addressed the problem of training classif...
Ashish Kapoor, Simon Baker, Sumit Basu, Eric Horvi...
CASSIS
2005
Springer
16 years 3 days ago
The Architecture of a Privacy-Aware Access Control Decision Component
Today many interactions are carried out online through Web sites and e-services and often private and/or sensitive information is required by service providers. A growing concern r...
Claudio Agostino Ardagna, Marco Cremonini, Ernesto...
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 12 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar