16404 search results - page 901 / 3281 » A set coverage problem |
188
Voted
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
230
click to vote
ISAAC
2007
Springer
16 years 1 months ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
220
Voted
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
Uncertain data are inherent in some important applications. Although a considerable amount of research has been dedicated to modeling uncertain data and answering some types of qu...
191
click to vote
GECCO
2005
Springer
16 years 1 months ago
2005
Springer
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
214
Voted
SWAT
2004
Springer
16 years 1 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...