447 search results - page 69 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
PODC
2006
ACM
14 years 2 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
SIAMSC
2008
13 years 8 months ago
2008
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
BMCBI
2010
13 years 8 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...