Sciweavers

1258 search results - page 171 / 252
» Architecture-driven Problem Decomposition
Sort
View
JMLR
2006
89views more  JMLR 2006»
13 years 9 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
SIAMSC
2008
111views more  SIAMSC 2008»
13 years 8 months ago
An Algebraic Multigrid Approach Based on a Compatible Gauge Reformulation of Maxwell's Equations
With the rise in popularity of compatible finite element, finite difference and finite volume discretizations for the time domain eddy current equations, there has been a correspon...
Pavel B. Bochev, Jonathan J. Hu, Christopher M. Si...
SOCO
2008
Springer
13 years 8 months ago
A particular Gaussian mixture model for clustering and its application to image retrieval
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...
Hichem Sahbi
TIP
2008
181views more  TIP 2008»
13 years 8 months ago
Sparse Representation for Color Image Restoration
Abstract--Sparse representations of signals have drawn considerable interest in recent years. The assumption that natural signals, such as images, admit a sparse decomposition over...
Julien Mairal, Michael Elad, Guillermo Sapiro
IVC
2007
98views more  IVC 2007»
13 years 8 months ago
Reversible vectorisation of 3D digital planar curves and applications
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
Isabelle Sivignon, Florent Dupont, Jean-Marc Chass...