Sciweavers

1258 search results - page 42 / 252
» Architecture-driven Problem Decomposition
Sort
View
DATE
2005
IEEE
116views Hardware» more  DATE 2005»
14 years 2 months ago
Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition
This paper addresses two problems related to disjointsupport decomposition of Boolean functions. First, we present a heuristic for finding a subset of variables, X, which results...
Andrés Martinelli, Elena Dubrova
IJON
2002
128views more  IJON 2002»
13 years 9 months ago
Extraction of a source from multichannel data using sparse decomposition
It was discovered recently that sparse decomposition by signal dictionaries results in dramatic improvement of the qualities of blind source separation. We exploit sparse decompos...
Michael Zibulevsky, Yehoshua Y. Zeevi
ML
2002
ACM
104views Machine Learning» more  ML 2002»
13 years 9 months ago
A Simple Decomposition Method for Support Vector Machines
The decomposition method is currently one of the major methods for solving support vector machines. An important issue of this method is the selection of working sets. In this pape...
Chih-Wei Hsu, Chih-Jen Lin
CVPR
1996
IEEE
14 years 1 months ago
Sparse Representations for Image Decomposition with Occlusions
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-red...
Michael J. Donahue, Davi Geiger, Tyng-Luh Liu, Rob...
ICML
2010
IEEE
13 years 10 months ago
Accelerated dual decomposition for MAP inference
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
Vladimir Jojic, Stephen Gould, Daphne Koller