Sciweavers

507 search results - page 60 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
LICS
2009
IEEE
14 years 2 months ago
The Inverse Taylor Expansion Problem in Linear Logic
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
Michele Pagani, Christine Tasson
TCS
2008
13 years 7 months ago
Multi-break rearrangements and chromosomal evolution
Most genome rearrangements (e.g., reversals and translocations) can be represented as 2-breaks that break a genome at 2 points and glue the resulting fragments in a new order. Mul...
Max A. Alekseyev, Pavel A. Pevzner
ISVC
2009
Springer
14 years 2 months ago
Robust Registration of Aerial Image Sequences
We describe techniques for registering images from sequences of aerial images captured of the same terrain on different days. The techniques are robust to changes in weather, incl...
Clark F. Olson, Adnan I. Ansar, Curtis W. Padgett
MICCAI
2000
Springer
13 years 11 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...
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 7 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...