4047 search results - page 170 / 810 » The Discrete Basis Problem |
172
click to vote
ISBI
2006
IEEE
16 years 7 months ago
2006
IEEE
Mutual information (MI) based image-registration methods that use histograms are known to suffer from the so-called binning problem, caused by the absence of a principled techniqu...
178
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
172
click to vote
CISS
2008
IEEE
16 years 28 days ago
2008
IEEE
Abstract—To achieve higher reliability, safety, and faulttolerance, many mission-critical detection and decision systems implement consensus algorithms that force the systems’ ...
164
click to vote
IPPS
2007
IEEE
16 years 23 days ago
2007
IEEE
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...
147
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...