644 search results - page 36 / 129 » Decomposition Complexity |
143
Voted
CP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
96
Voted
ICASSP
2010
IEEE
15 years 23 days ago
2010
IEEE
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
107
Voted
BMCBI
2008
15 years 21 days ago
2008
Background: The fast growing Protein Data Bank contains the three-dimensional description of more than 45000 protein- and nucleic-acid structures today. The large majority of the ...
109
Voted
MOBIHOC
2010
ACM
14 years 10 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
116
click to vote
ICPP
2006
IEEE
15 years 6 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...