Sciweavers

4591 search results - page 841 / 919
» Learning from Dyadic Data
Sort
View
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
14 years 2 months ago
Adaptive genetic programming for option pricing
Genetic Programming (GP) is an automated computational programming methodology, inspired by the workings of natural evolution techniques. It has been applied to solve complex prob...
Zheng Yin, Anthony Brabazon, Conall O'Sullivan
IPMI
2007
Springer
14 years 2 months ago
Joint Sulci Detection Using Graphical Models and Boosted Priors
In this paper we propose an automated approach for joint sulci detection on cortical surfaces by using graphical models and boosting techniques to incorporate shape priors of major...
Yonggang Shi, Zhuowen Tu, Allan L. Reiss, Rebecca ...
SGAI
2007
Springer
14 years 2 months ago
Evolving a Dynamic Predictive Coding Mechanism for Novelty Detection
Novelty detection is a machine learning technique which identifies new or unknown information in large data sets. We present our current work on the construction of a new novelty...
Simon J. Haggett, Dominique F. Chu, Ian W. Marshal...
INFOCOM
2006
IEEE
14 years 2 months ago
Sampling Techniques for Large, Dynamic Graphs
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
ISPASS
2006
IEEE
14 years 2 months ago
Comparing multinomial and k-means clustering for SimPoint
SimPoint is a technique used to pick what parts of the program’s execution to simulate in order to have a complete picture of execution. SimPoint uses data clustering algorithms...
Greg Hamerly, Erez Perelman, Brad Calder