2109 search results - page 176 / 422 » Solving Necklace Constraint Problems |
155
click to vote
SAC
1998
ACM
15 years 10 months ago
1998
ACM
This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time...
179
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
184
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
164
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
177
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper considers the problem of finding sparse solutions from multiple measurement vectors (MMVs) with joint sparsity. The solutions share the same sparsity structure, and th...