Sciweavers

360 search results - page 56 / 72
» The TV-Break Packing Problem
Sort
View
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 5 months ago
Dense Error-Correcting Codes in the Lee Metric
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...
Tuvi Etzion, Alexander Vardy, Eitan Yaakobi
EMMCVPR
2007
Springer
14 years 1 months ago
Simulating Classic Mosaics with Graph Cuts
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
Yu Liu, Olga Veksler, Olivier Juan
ESA
2009
Springer
146views Algorithms» more  ESA 2009»
14 years 2 months ago
Kernel Bounds for Disjoint Cycles and Disjoint Paths
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
Hans L. Bodlaender, Stéphan Thomassé...
IPPS
2003
IEEE
14 years 20 days ago
Allocating Servers in Infostations for On-Demand Communications
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
JCSS
2007
89views more  JCSS 2007»
13 years 7 months ago
The relative worst-order ratio applied to paging
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen