210
click to vote
TIP
2011
15 years 1 months ago
2011
—This paper introduces the new color face recognition (FR) method that makes effective use of boosting learning as color-component feature selection framework. The proposed boost...
217
click to vote
TIP
2011
15 years 1 months ago
2011
—In this paper, we address the super resolution (SR) problemfromasetofdegradedlowresolution(LR)imagestoobtain a high resolution (HR) image. Accurate estimation of the sub-pixel m...
281
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
227
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
342
click to vote
TCAD
2011
15 years 1 months ago
2011
—Escalating system-on-chip design complexity is the design community to raise the level of abstraction beyond register transfer level. Despite the unsuccessful adoptions of early...
207
click to vote
TC
2011
15 years 1 months ago
2011
— Implementing shared memory consistency models on top of hardware caches gives rise to the well-known cache coherence problem. The standard solution involves implementing cohere...
206
click to vote
SPIC
2011
15 years 1 months ago
2011
This paper proposes a collaborative color calibration method for multi-camera systems. The multi-camera color calibration problem is formulated as an overdetermined linear system,...
213
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The Discretizable Molecular Distance Geometry Problem is a subset of instances of the distance geometry problem that can be solved by a combinatorial algorithm called "Branch-...