Sciweavers

2365 search results - page 242 / 473
» All things are connected
Sort
View
COMBINATORICA
2007
148views more  COMBINATORICA 2007»
15 years 6 months ago
Colored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...
JAPLL
2008
101views more  JAPLL 2008»
15 years 6 months ago
Circle graphs and monadic second-order logic
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
Bruno Courcelle
JNW
2008
86views more  JNW 2008»
15 years 6 months ago
A Railway Signal Control System by Optical LAN and Design Simplification
When replace railway interlocking devices, setting up of large number of signal cables and confirming of wiring connections are required. So, it is worried that serious transport d...
Takashi Kunifuji, Jun Nishiyama, Hiroyuki Sugahara...
CVGIP
2007
187views more  CVGIP 2007»
15 years 6 months ago
Facial motion cloning with radial basis functions in MPEG-4 FBA
Facial Motion Cloning (FMC) is the technique employed to transfer the motion of a virtual face (namely the source) to a mesh representing another face (the target), generally havi...
Marco Fratarcangeli, Marco Schaerf, Robert Forchhe...
PE
2008
Springer
102views Optimization» more  PE 2008»
15 years 6 months ago
Multipoint-to-point lightpaths in all-optical networks: Dimensioning and cost analysis
One of the major concerns in optical networks is the bandwidth underutilization problem. In fact, as WDM technology keeps maturing, there is a bandwidth gap between the transmissi...
Nizar Bouabdallah, Guy Pujolle, Harry G. Perros