Sciweavers

520 search results - page 38 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
ICDM
2005
IEEE
185views Data Mining» more  ICDM 2005»
14 years 2 months ago
Semi-Supervised Mixture of Kernels via LPBoost Methods
We propose an algorithm to construct classification models with a mixture of kernels from labeled and unlabeled data. The derived classifier is a mixture of models, each based o...
Jinbo Bi, Glenn Fung, Murat Dundar, R. Bharat Rao
CIMAGING
2009
94views Hardware» more  CIMAGING 2009»
13 years 6 months ago
Iterative demosaicking accelerated: theory and fast noniterative implementations
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternatin...
Yue M. Lu, Mina Karzand, Martin Vetterli
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 5 months ago
Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...
Gilles Meyer, Silvere Bonnabel, Rodolphe Sepulchre
ARTMED
2006
158views more  ARTMED 2006»
13 years 8 months ago
CareVis: Integrated visualization of computerized protocols and temporal patient data
Objective: Currently, visualization support for patient data analysis is mostly limited to the representation of directly measured data. Contextual information on performed treatm...
Wolfgang Aigner, Silvia Miksch
ASPDAC
2010
ACM
155views Hardware» more  ASPDAC 2010»
13 years 6 months ago
Efficient model reduction of interconnects via double gramians approximation
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...
Boyuan Yan, Sheldon X.-D. Tan, Gengsheng Chen, Yic...