791 search results - page 34 / 159 » Approximating the Maximum Sharing Problem |
3DPVT
2006
IEEE
15 years 6 months ago
2006
IEEE
We present an algorithm for generating panoramic images of complex scenes from a multi-sensor camera. We further present a programmable graphics hardware implementation to process...
WAIM
2007
Springer
15 years 6 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
126
click to vote
PODC
2009
ACM
16 years 11 days ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
100
click to vote
RECOMB
2005
Springer
16 years 4 days 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...
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...