453 search results - page 63 / 91 » Tight bounds for the partial-sums problem |
110
click to vote
PAMI
2007
15 years 4 days ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
110
Voted
AAAI
2010
15 years 2 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
89
Voted
DCC
2006
IEEE
16 years 7 days ago
2006
IEEE
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
108
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
125
click to vote
RANDOM
1998
Springer
15 years 4 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...