Sciweavers

2796 search results - page 526 / 560
» The coolest path problem
Sort
View
ICASSP
2010
IEEE
15 years 19 hour ago
Partial sequence matching using an Unbounded Dynamic Time Warping algorithm
Before the advent of Hidden Markov Models(HMM)-based speech recognition, many speech applications were built using pattern matching algorithms like the Dynamic Time Warping (DTW) ...
Xavier Anguera, Robert Macrae, Nuria Oliver
CG
2008
Springer
14 years 12 months ago
Practical global illumination for interactive particle visualization
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...
Christiaan P. Gribble, Carson Brownlee, Steven G. ...
CGF
2008
174views more  CGF 2008»
14 years 12 months ago
Particle Level Set Advection for the Interactive Visualization of Unsteady 3D Flow
Typically, flow volumes are visualized by defining their boundary as iso-surface of a level set function. Grid-based level sets offer a good global representation but suffer from ...
Nicolas Cuntz, Andreas Kolb, Robert Strzodka, Dani...
CN
2008
126views more  CN 2008»
14 years 12 months ago
Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
Pallab Datta, Arun K. Somani
COMCOM
2008
100views more  COMCOM 2008»
14 years 12 months ago
Multicast algorithms in service overlay networks
Overlay routing has been proposed to enhance the reliability and performance of IP networks, since it can bypass congestion and transient outages by forwarding traffic through one ...
Dario Pompili, Caterina M. Scoglio, Luca Lopez