1647 search results - page 116 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
131
Voted
RANDOM
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
180
Voted
FSTTCS
2003
Springer
15 years 10 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
143
click to vote
ECCV
2000
Springer
16 years 6 months ago
2000
Springer
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...
148
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
168
click to vote
SIGMOD
2002
ACM
16 years 5 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...