1647 search results - page 249 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
COCO
2003
Springer
14 years 2 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
MDM
2009
Springer
14 years 3 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
PVLDB
2008
13 years 8 months ago
2008
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...