429 search results - page 52 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
ICCV
2011
IEEE
13 years 10 months ago
2011
IEEE
We consider the problem of quantizing data generated from disparate sources, e.g. subjects performing actions with different styles, movies with particular genre bias, various con...
COCO
2003
Springer
15 years 3 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 ...
STOC
2005
ACM
15 years 3 months ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
102
click to vote
IWPEC
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...