Sciweavers

2177 search results - page 269 / 436
» Relative Margin Machines
Sort
View
ALT
2002
Springer
16 years 22 days ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
ALT
2000
Springer
16 years 22 days ago
On Approximate Learning by Multi-layered Feedforward Circuits
Abstract. We consider the problem of efficient approximate learning by multilayered feedforward circuits subject to two objective functions. First, we consider the objective to ma...
Bhaskar DasGupta, Barbara Hammer
ALT
2000
Springer
16 years 22 days ago
Learning Recursive Concepts with Anomalies
This paper provides a systematic study of inductive inference of indexable concept classes in learning scenarios in which the learner is successful if its final hypothesis describ...
Gunter Grieser, Steffen Lange, Thomas Zeugmann
CGO
2009
IEEE
15 years 10 months ago
Reducing Memory Ordering Overheads in Software Transactional Memory
—Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total St...
Michael F. Spear, Maged M. Michael, Michael L. Sco...
ISPASS
2009
IEEE
15 years 10 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...