Sciweavers

18090 search results - page 3138 / 3618
» Computing by Only Observing
Sort
View
JCO
2011
113views more  JCO 2011»
15 years 1 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
JCT
2011
84views more  JCT 2011»
15 years 1 months ago
Enumerating isodiametric and isoperimetric polygons
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
Michael J. Mossinghoff
SCP
2011
228views Communications» more  SCP 2011»
15 years 1 months ago
Channel-based coordination via constraint satisfaction
Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, howe...
Dave Clarke, José Proença, Alexander...
TASLP
2011
15 years 1 months ago
Advances in Missing Feature Techniques for Robust Large-Vocabulary Continuous Speech Recognition
— Missing feature theory (MFT) has demonstrated great potential for improving the noise robustness in speech recognition. MFT was mostly applied in the log-spectral domain since ...
Maarten Van Segbroeck, Hugo Van Hamme
TASLP
2011
15 years 1 months ago
Estimating Dominance in Multi-Party Meetings Using Speaker Diarization
—With the increase in cheap commercially available sensors, recording meetings is becoming an increasingly practical option. With this trend comes the need to summarize the recor...
Hayley Hung, Yan Huang, Gerald Friedland, Daniel G...
« Prev « First page 3138 / 3618 Last » Next »