2137 search results - page 308 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
176
click to vote
ACM
1995
15 years 8 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
175
click to vote
DATAMINE
2010
15 years 5 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
190
Voted
JMLR
2010
14 years 11 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
148
Voted
AAECC
2005
Springer
15 years 4 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
140
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...