16404 search results - page 537 / 3281 » A set coverage problem |
204
click to vote
WSOM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
166
click to vote
ISCAS
2006
IEEE
16 years 28 days ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
177
click to vote
CONEXT
2006
ACM
16 years 27 days ago
2006
ACM
Confronted with the generalization of monitoring in operational networks, researchers have proposed placement algorithms that can help ISPs deploy their monitoring infrastructure ...
151
click to vote
ICN
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. This paper considers the primary and secondary path generation problem in traffic engineering. We first present a standard MILP model. Since its size and integrality gap...
206
click to vote
SCN
2004
Springer
16 years 8 days ago
2004
Springer
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...