1258 search results - page 140 / 252 » Architecture-driven Problem Decomposition |
EDBTW
2006
Springer
14 years 20 days ago
2006
Springer
The wavelet decomposition is a proven tool for constructing concise synopses of massive data sets and rapid changing data streams, which can be used to obtain fast approximate, wit...
GECCO
2006
Springer
14 years 20 days ago
2006
Springer
Cooperative coevolution is often used to solve difficult optimization problems by means of problem decomposition. Its performance on this task is influenced by many design decisio...
ICALP
1995
Springer
14 years 17 days ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
NIPS
2001
13 years 10 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
UAI
2004
13 years 10 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...