4110 search results - page 135 / 822 » Efficient algorithms for the 2-gathering problem |
136
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
Nowadays a placement problem often involves multi-million objects and excessive fixed blockages. We present a new global placement algorithm that scales well to the modern large-s...
153
click to vote
AAAI
2006
15 years 5 months ago
2006
Reasoning with both probabilistic and deterministic dependencies is important for many real-world problems, and in particular for the emerging field of statistical relational lear...
127
click to vote
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
139
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
160
click to vote
CATA
2006
15 years 5 months ago
2006
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Lo...