429 search results - page 44 / 86 » Solving the Maximum Clique Problem Using PUBB |
78
Voted
ESANN
2006
14 years 11 months ago
2006
The Blind Source Separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical dependency between outputs. Since global maximization may be ...
112
click to vote
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
67
Voted
ENTCS
2008
14 years 9 months ago
2008
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
106
click to vote
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
TSP
2011
14 years 4 months ago
2011
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...