Sciweavers

1845 search results - page 50 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
ICML
2005
IEEE
14 years 10 months ago
Predictive low-rank decomposition for kernel methods
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
Francis R. Bach, Michael I. Jordan
ICML
1999
IEEE
14 years 10 months ago
Approximation Via Value Unification
: Numerical function approximation over a Boolean domain is a classical problem with wide application to data modeling tasks and various forms of learning. A great many function ap...
Paul E. Utgoff, David J. Stracuzzi
EDUTAINMENT
2006
Springer
14 years 26 days ago
Research of Dynamic Terrain in Complex Battlefield Environments
In this paper, we present a novel method for dynamic terrain in battlefield and an efficient plan to simulate crater in the battle. We explore a few methods for dynamic terrain sur...
Xingquan Cai, Fengxia Li, Haiyan Sun, Shouyi Zhan
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 10 months ago
Evolving sequence patterns for prediction of sub-cellular locations of eukaryotic proteins
A genetic algorithm (GA) is utilised to discover known and novel PROSITE-like sequence templates that can be used to classify the sub-cellular location of eukaryotic proteins. Whi...
Greg Paperin
ICML
2007
IEEE
14 years 10 months ago
Relational clustering by symmetric convex coding
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...