Sciweavers

358 search results - page 66 / 72
» Sparse squares of polynomials
Sort
View
STACS
2004
Springer
15 years 2 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
COLT
2006
Springer
15 years 1 months ago
DNF Are Teachable in the Average Case
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
Homin K. Lee, Rocco A. Servedio, Andrew Wan
MICCAI
2000
Springer
15 years 1 months ago
Nonrigid Registration of 3D Scalar, Vector and Tensor Medical Data
New medical imaging modalities offering multi-valued data, such as phase contrast MRA and diffusion tensor MRI, require general representations for the development of automatized a...
Juan Ruiz-Alzola, Carl-Fredrik Westin, Simon K. Wa...
NIPS
2008
14 years 10 months ago
Hierarchical Semi-Markov Conditional Random Fields for Recursive Sequential Data
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirected Markov ...
Tran The Truyen, Dinh Q. Phung, Hung Hai Bui, Svet...
CORR
2010
Springer
167views Education» more  CORR 2010»
14 years 9 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...