Sciweavers

14158 search results - page 188 / 2832
» Generalized switch-setting problems
Sort
View
DAM
2008
136views more  DAM 2008»
15 years 3 months ago
General theory of information transfer: Updated
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main con...
Rudolf Ahlswede
130
Voted
TIP
2008
153views more  TIP 2008»
15 years 3 months ago
Generalized Flooding and Multicue PDE-Based Image Segmentation
Image segmentation remains an important, but hard-to-solve, problem since it appears to be application dependent with usually no a priori information available regarding the image ...
Anastasia Sofou, Petros Maragos
133
Voted
WG
2004
Springer
15 years 8 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
126
Voted
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 7 months ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev
140
Voted
FOCS
2009
IEEE
15 years 10 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov