Sciweavers

1963 search results - page 294 / 393
» The Maximum Solution Problem on Graphs
Sort
View
106
Voted
AIPS
2008
15 years 3 months ago
Linear Relaxation Techniques for Task Management in Uncertain Settings
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably j...
Pradeep Varakantham, Stephen F. Smith
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 10 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
99
Voted
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 1 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
91
Voted
DCC
2006
IEEE
16 years 6 days ago
Joint Source-Channel Decoding of Multiple Description Quantized Markov Sequences
This paper proposes a framework for joint source-channel decoding of Markov sequences that are coded by a fixed-rate multiple description quantizer (MDQ), and transmitted via a lo...
Xiaolin Wu, Xiaohan Wang
105
Voted
ACCV
2007
Springer
15 years 6 months ago
User-Guided Shape from Shading to Reconstruct Fine Details from a Single Photograph
Abstract. Many real objects, such as faces, sculptures, or low-reliefs are composed of many detailed parts that can not be easily modeled by an artist nor by 3D scanning. In this p...
Alexandre Meyer, Héctor M. Briceño, ...