Sciweavers

2192 search results - page 102 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
Formant-based technique for automatic filled-pause detection in spontaneous spoken english
Detection of filled pauses is a challenging research problem which has several practical applications. It can be used to evaluate the spoken fluency skills of the speaker, to im...
Kartik Audhkhasi, Kundan Kandhway, Om Deshmukh, As...
DIGRA
2005
Springer
14 years 1 months ago
Realistic Agent Movement in Dynamic Game Environments
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core...
Ross Graham, Hugh McCabe, Stephen Sheridan
NIPS
2008
13 years 9 months ago
Efficient Sampling for Gaussian Process Inference using Control Variables
Sampling functions in Gaussian process (GP) models is challenging because of the highly correlated posterior distribution. We describe an efficient Markov chain Monte Carlo algori...
Michalis Titsias, Neil D. Lawrence, Magnus Rattray
ICCMS
2009
118views more  ICCMS 2009»
13 years 6 months ago
Optimized Parallel Implementation of Gillespie's First Reaction Method on Graphics Processing Units
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...
Cristian Dittamo, Davide Cangelosi
INFOCOM
2000
IEEE
14 years 18 days ago
On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
— The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. After addressing the characteristics of wireless netw...
Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Eph...