1258 search results - page 83 / 252 » Architecture-driven Problem Decomposition |
CVPR
2009
IEEE
14 years 4 months ago
2009
IEEE
Most research on image decomposition, e.g. image segmentation and image parsing, has predominantly focused on the low-level visual clues within single image and neglected the cont...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
Modern applications such as Internet traffic, telecommunication records, and large-scale social networks generate massive amounts of data with multiple aspects and high dimensiona...
ICPP
2006
IEEE
14 years 3 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...
ICDT
2010
ACM
13 years 8 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...