569 search results - page 45 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
JMLR
2010
13 years 2 months ago
2010
We present an extension of sparse PCA, or sparse dictionary learning, where the sparsity patterns of all dictionary elements are structured and constrained to belong to a prespeci...
AINA
2008
IEEE
14 years 2 months ago
2008
IEEE
—In the paper, we study the wavelength assignment problem in waveband switching (WBS) networks, which is composed of multi-granular optical cross-connect (MG-OXCs) interconnected...
JACM
2002
13 years 7 months ago
2002
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...