Sciweavers

539 search results - page 47 / 108
» Recurrence relations and fast algorithms
Sort
View
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 17 days 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...
96
Voted
DATE
2010
IEEE
121views Hardware» more  DATE 2010»
15 years 5 months ago
Properties of and improvements to time-domain dynamic thermal analysis algorithms
—Temperature has a strong influence on integrated circuit (IC) performance, power consumption, and reliability. However, accurate thermal analysis can impose high computation co...
Xi Chen, Robert P. Dick, Li Shang
90
Voted
MICCAI
2008
Springer
16 years 1 months ago
Symmetric Log-Domain Diffeomorphic Registration: A Demons-Based Approach
Abstract. Modern morphometric studies use non-linear image registration to compare anatomies and perform group analysis. Recently, logEuclidean approaches have contributed to promo...
Tom Vercauteren, Xavier Pennec, Aymeric Perchant...
140
Voted
BMCBI
2007
226views more  BMCBI 2007»
15 years 18 days ago
MiRFinder: an improved approach and software implementation for genome-wide fast microRNA precursor scans
Background: MicroRNAs (miRNAs) are recognized as one of the most important families of noncoding RNAs that serve as important sequence-specific post-transcriptional regulators of ...
Ting-Hua Huang, Bin Fan, Max F. Rothschild, Zhi-Li...
FOCS
2002
IEEE
15 years 5 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich