Sciweavers

374 search results - page 66 / 75
» sum 2010
Sort
View
ENTCS
2007
153views more  ENTCS 2007»
13 years 10 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
ECCC
2000
140views more  ECCC 2000»
13 years 9 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
MIA
2010
170views more  MIA 2010»
13 years 4 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...
MST
2010
196views more  MST 2010»
13 years 4 months ago
Non-Cooperative Cost Sharing Games via Subsidies
We consider a cost sharing system where users are selfish and act according to their own interest. There is a set of facilities and each facility provides services to a subset of ...
Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ar...
SIAMIS
2010
156views more  SIAMIS 2010»
13 years 4 months ago
Learning the Morphological Diversity
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...
Gabriel Peyré, Jalal Fadili, Jean-Luc Starc...