387 search results - page 31 / 78 » Mining Approximative Descriptions of Sets Using Rough Sets |
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
TIT
2010
13 years 2 months ago
2010
We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of 2 K 1 information sources, ordered in a decreasing level of importance, is encoded into K me...
BMCBI
2006
13 years 7 months ago
2006
Background: The number of sequences compiled in many genome projects is growing exponentially, but most of them have not been characterized experimentally. An automatic annotation...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...