644 search results - page 49 / 129 » Decomposition Complexity |
101
click to vote
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
We propose a new fast Feldkamp algorithm for 3-D cone beam tomography with a circular source trajectory. The algorithm is an extension of our recent fast native 2-D fan-beam recon...
128
click to vote
COMPGEOM
1995
ACM
15 years 4 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
123
click to vote
CSMR
2009
IEEE
15 years 5 months ago
2009
IEEE
Decomposing a software system into smaller, more manageable clusters is a common approach to support the comprehension of large systems. In recent years, researchers have focused ...
143
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
124
click to vote
PODC
2010
ACM
15 years 2 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...