1258 search results - page 67 / 252 » Architecture-driven Problem Decomposition |
VMV
2001
13 years 10 months ago
2001
Efficient handling of large polygonal scenes has always been a challenging task and in recent years, view-frustum and occlusion culling have drawn a lot of attention for accomplis...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Suppose a given observation matrix can be decomposed as the sum of a low-rank matrix and a sparse matrix (outliers), and the goal is to recover these individual components from th...
EMNLP
2010
13 years 7 months ago
2010
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
PVM
2005
Springer
14 years 2 months ago
2005
Springer
We consider a parallel decomposition technique for solving the large quadratic programs arising in training the learning methodology Support Vector Machine. At each iteration of th...
SMA
2003
ACM
14 years 2 months ago
2003
ACM
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...