Sciweavers

829 search results - page 54 / 166
» Adverse selection in online
Sort
View
NIPS
2008
15 years 1 months ago
An Homotopy Algorithm for the Lasso with Online Observations
It has been shown that the problem of 1-penalized least-square regression commonly referred to as the Lasso or Basis Pursuit DeNoising leads to solutions that are sparse and there...
Pierre Garrigues, Laurent El Ghaoui
FTCS
1993
123views more  FTCS 1993»
15 years 1 months ago
Fast, On-Line Failure Recovery in Redundant Disk Arrays
This paper describes and evaluates two algorithms for performing on-line failure recovery (data reconstruction) in redundant disk arrays. It presents an implementation of disk-ori...
Mark Holland, Garth A. Gibson, Daniel P. Siewiorek
EOR
2010
110views more  EOR 2010»
14 years 12 months ago
Online scheduling policies for multiclass call centers with impatient customers
We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s + M queue, we focus on developing ...
Oualid Jouini, Auke Pot, Ger Koole, Yves Dallery
PR
2006
88views more  PR 2006»
14 years 11 months ago
Directional features in online handwriting recognition
The selection of valuable features is crucial in pattern recognition. In this paper we deal with the issue that part of features originate from directional instead of common linea...
Claus Bahlmann
CGF
2008
120views more  CGF 2008»
14 years 11 months ago
Online Personalised Non-photorealistic Rendering Technique for 3D Geometry from Incremental Sketching
This paper presents an online personalised non-photorealistic rendering (NPR) technique for 3D models generated from interactively sketched input. This technique has been integrat...
Daychyi Ku, Sheng Feng Qin, David K. Wright, CuiXi...