Sciweavers

3630 search results - page 427 / 726
» Fast Marching Methods
Sort
View
ADMA
2010
Springer
271views Data Mining» more  ADMA 2010»
14 years 11 months ago
Exploiting Concept Clumping for Efficient Incremental E-Mail Categorization
We introduce a novel approach to incremental e-mail categorization based on identifying and exploiting "clumps" of messages that are classified similarly. Clumping reflec...
Alfred Krzywicki, Wayne Wobcke
JCNS
2011
61views more  JCNS 2011»
14 years 11 months ago
Automating the design of informative sequences of sensory stimuli
Adaptive stimulus design methods can potentially improve the efficiency of sensory neurophysiology experiments significantly; however, designing optimal stimulus sequences in re...
Jeremy Lewi, David M. Schneider, Sarah M. N. Wooll...
TEC
2010
171views more  TEC 2010»
14 years 11 months ago
A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...
Shengxiang Yang, Changhe Li
ICASSP
2011
IEEE
14 years 8 months ago
Efficient search of music pitch contours using wavelet transforms and segmented dynamic time warping
We propose a method of music melody matching based on their “continuous” (or “time-frame-based”) pitch contours. Most previous methods using frame-based contours either ma...
Woojay Jeon, Changxue Ma
172
Voted
AAAI
2012
13 years 7 months ago
Kernel-Based Reinforcement Learning on Representative States
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
Branislav Kveton, Georgios Theocharous