Sciweavers

2523 search results - page 26 / 505
» Objective: In Minimum Context
Sort
View
ISAAC
2005
Springer
110views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Minimum Entropy Coloring
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
CMMR
2007
Springer
119views Music» more  CMMR 2007»
15 years 4 months ago
Focus-Plus-Context Audio Interaction Design
Abstract. NEEDS REWRITE We present an audio browsing and editing paradigm that incorporates the “focus plus context” visual interaction metaphor. A traditional waveform is disp...
David Gerhard, Brett Park, Jarrod Ellis
FOCS
2008
IEEE
15 years 4 months ago
The Power of Reordering for Online Minimum Makespan Scheduling
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
Matthias Englert, Deniz Özmen, Matthias Weste...
ISCC
2005
IEEE
15 years 3 months ago
Optimal Delay-Constrained Minimum Cost Loop Algorithm for Local Computer Network
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
Yong-Jin Lee, Mohammed Atiquzzaman
DCOSS
2007
Springer
15 years 1 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev