1782 search results - page 333 / 357 » Learning in Parallel Universes |
PPSN
1990
Springer
13 years 11 months ago
1990
Springer
T h e ease of learning concepts f r o m examples in empirical machine learning depends on the attributes used for describing the training d a t a . We show t h a t decision-tree b...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
CCGRID
2007
IEEE
14 years 1 months ago
2007
IEEE
Experimental performance studies on computer systems, including Grids, require deep understandings on their workload characteristics. The need arises from two important and closel...
BCS
2008
13 years 8 months ago
2008
This paper describes a customisable processor designed to accelerate execution of inductive logic programming, targeting advanced field-programmable gate array (FPGA) technology. ...
COCO
2003
Springer
14 years 18 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...