Sciweavers

710 search results - page 85 / 142
» On Minimum Power Connectivity Problems
Sort
View
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
15 years 5 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
ENTCS
2008
115views more  ENTCS 2008»
15 years 5 months ago
Time Separation of Events: An Inverse Method
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
Emmanuelle Encrenaz, Laurent Fribourg
DCC
2008
IEEE
16 years 5 months ago
Server Placement in Multiple-Description-Based Media Streaming
Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a me...
Satyajeet Ahuja, Marwan Krunz
GLOBECOM
2006
IEEE
15 years 11 months ago
Algorithms for Server Placement in Multiple-Description-Based Media Streaming
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
Satyajeet Ahuja, Marwan Krunz
IJCNN
2006
IEEE
15 years 11 months ago
Echo State Networks for Determining Harmonic Contributions from Nonlinear Loads
—This paper investigates the application of a new kind of recurrent neural network called Echo State Networks (ESNs) for the problem of measuring the actual amount of harmonic cu...
Joy Mazumdar, Ganesh K. Venayagamoorthy, Ronald G....