681 search results - page 20 / 137 » General Polynomial Time Decomposition Algorithms |
125
click to vote
TNN
2008
15 years 14 days ago
2008
Abstract--Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), indepe...
103
Voted
IJAR
2010
14 years 11 months ago
2010
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
123
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
105
Voted
GD
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...