Sciweavers

791 search results - page 34 / 159
» Approximating the Maximum Sharing Problem
Sort
View
3DPVT
2006
IEEE
176views Visualization» more  3DPVT 2006»
14 years 1 months ago
Belief Propagation for Panorama Generation
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...
Alan Brunton, Chang Shu
WAIM
2007
Springer
14 years 1 months ago
Building Data Synopses Within a Known Maximum Error Bound
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...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
PODC
2009
ACM
14 years 8 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
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...
Christos Koufogiannakis, Neal E. Young
RECOMB
2005
Springer
14 years 8 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
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...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
SWAT
2004
Springer
156views Algorithms» more  SWAT 2004»
14 years 1 months ago
The Bottleneck Problem with Minimum Quantity Commitments
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...
Andrew Lim, Zhou Xu