Sciweavers

3837 search results - page 163 / 768
» Learning Approximate Consistencies
Sort
View
IADIS
2004
15 years 6 months ago
Electronic case studies: a problem-based learning approach
E-Cases is an innovative approach to management development. Traditional case studies typically describe a decision or a problem in a real-life setting. E-Cases encourage students...
Philip M. Drinkwater, Christopher P. Holland, K. N...
ICASSP
2008
IEEE
15 years 11 months ago
Maximum entropy relaxation for multiscale graphical model selection
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
ICML
2010
IEEE
15 years 4 months ago
A DC Programming Approach for Sparse Eigenvalue Problem
We investigate the sparse eigenvalue problem which arises in various fields such as machine learning and statistics. Unlike standard approaches relying on approximation of the l0n...
Mamadou Thiao, Pham Dinh Tao, Le Thi Hoai An
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
15 years 11 months ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
TAPIA
2005
ACM
15 years 10 months ago
Computation of nonclassical shocks using a spacetime discontinuous Galerkin method
We present a numerical study for two systems of conservation laws using a spacetime discontinuous Galerkin (SDG) method with causal spacetime triangulations and the piecewise cons...
Katarina Jegdic